zbMATH — the first resource for mathematics

Matroids and the greedy algorithm. (English) Zbl 0253.90027

90C05 Linear programming
Full Text: DOI
[1] Jack Edmonds, ”Maximum matching and a polyhedron with {0, 1}-vertices,”Journal of Research of the National Bureau of Standards 69B (1965) 125–130. · Zbl 0141.21802
[2] Jack Edmonds, ”Matroid partition, Math. of the Decision Sciences,”American Mathematical Society Lectures in Applied Mathematics 11 (1968) pp. 335–345.
[3] Jack Edmonds, ”Optimum branchings,”Journal of Research of the National Bureau of Standards 71B (1967) 233–240; reprinted with [2], pp. 346–361. · Zbl 0155.51204
[4] Jack Edmonds, ”Systems of distinct representatives and linear algebra,”Journal of Research National Bureau of Standards 71B (1967) 241–245. · Zbl 0178.03002
[5] J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem,Proceedings American Mathematical Society 7 (1956) 48–50. · Zbl 0070.18404 · doi:10.1090/S0002-9939-1956-0078686-7
[6] P. Rosenstiehl, ”L’arbre minimum d’un graphe,”Proc. Int’l. Symp. on the Theory of Graphs in Rome 1966 (Dunod/Gordon-Breach, 1967).
[7] R. Rado, ”Note on independence functions,”Proceedings London Mathematical Society 7 (1957) 300–320. · Zbl 0083.02302 · doi:10.1112/plms/s3-7.1.300
[8] H. Whitney, ”On the abstract properties of linear dependence,”American Journal of Mathematics 57 (1935) 509–533. · Zbl 0012.00404 · doi:10.2307/2371182
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.