1. A.K. Chandra and C.K. Wong, “Worst case analysis of a placement algorithm related to storage allocation”, SIAM Journal on Computing 4 (1975) 249–263.
2. G. Cornuejols, M.L. Fisher and G.L. Nemhauser, “Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms”, Management Science 23 (1977) 789–810.
3. Lectures in Applied Mathematics;J. Edmonds,1968
4. J. Edmonds, “Submodular functions, matroids and certain polyhedra”, in: R. Guy, ed., Combinatorial structures and their applications (Gordon and Breach, New York, 1971) pp. 69–87.
5. T.A. Jenkyns, “The efficiency of the “greedy” algorithm”, in: Proceedings of the 7th S.E. Conference on combinatorics, graph theory and computing (Utilitas Mathematica, Winnipeg, 1976) pp. 341–350.