1. U. Baumgarten, Worst-case-Abschätzung für die Greedy-Heuristic auf monotonen Mengensyste men, Working Paper, Institut für Ökonometrie und Operations Research, University Bonn (1976)
2. S. A. Cook, The complexity of theorem-proving procedures, Proc. 3rd ACM Symp. Theory of Computing (1971) 151–158
3. Matroids and the greedy algorithm;Edmonds;Math. Programming,1971
4. J. Edmonds, Matroid intersection, unpublished working paper (1976)
5. J. Edmonds, private communication (1976)