Matroids and the greedy algorithm
暂无分享，去创建一个
Linear-algebra rank is the solution to an especially tractable optimization problem. This tractability is viewed abstractly, and extended to certain more general optimization problems which are linear programs relative to certain derived polyhedra.
[1] H. Whitney. On the Abstract Properties of Linear Dependence , 1935 .
[2] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[3] R. Rado. Note on Independence Functions , 1957 .
[4] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[5] J. Edmonds. Systems of distinct representatives and linear algebra , 1967 .