理学 算法设计 释 greedy algorithm 贪心法 优化问题的算法通常由一系列步骤组成，每一步包含一个选择集合。贪心法总是作当时看起来最好的选择，也就是说，它每一步作一个局部最优的选择以期这个选择最终导致一个全局的最优解。
＞运筹学＞组合优化＞释义 greedy algorithm 贪婪算法 greedy algorithm 贪婪算法†
理论计算机科学 算法设计与分析 释文 greedy algorithm 贪婪算法 理论计算机科学 算法设计与分析 释文 greedy algorithm 贪婪算法
- rank of a graph
- rank of a group
- rank of a lattice
- rank of a Lie algebra
- rank of a linear mapping
- rank of a linear transformation
- rank of a matrix
- rank of a module
- rank of an algebra
- rank of an algebraic group
- rank of an analytic mapping
- rank of an eigenvalue
- rank of an element
- rank of an elliptic curve
- rank of an ideal
- rank of an operator
- rank of a partition
- rank of a prime ideal
- rank of a projective module
- rank of a quadratic form
- rank of a relation
- rank of a ring
- rank of a root system
- rank of a set
- rank of a set of vectors