Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem

On the shortest spanning subtree of a graph and the traveling salesman problem

Joseph B. Kruskal · Proceedings of the American Mathematical Society · 1956 · 5.1K citations · Full text

Natural Sciences, Mathematics, Algebra +11

An analysis of approximations for maximizing submodular set functions—I

George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher · Mathematical Programming · 1978 · 4.5K citations

Natural Sciences, Computer Science, Mathematics +10

A Greedy Heuristic for the Set-Covering Problem

Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations

Natural Sciences, Computer Science, Mathematics +17

Matroids and the greedy algorithm

Jack Edmonds · Mathematical Programming · 1971 · 878 citations

Natural Sciences, Computer Science, Mathematics +11

Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

Gérard Cornuéjols, Marshall L. Fisher, George L. Nemhauser · Management Science · 1977 · 802 citations

Business, Business Economics, Economics +17