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

This publication has 7 references indexed in Scilit:

• A Greedy Heuristic for the Set-Covering Problem
  Mathematics of Operations Research, 1979
• An analysis of approximations for maximizing submodular set functions—I
  Mathematical Programming, 1978
• An Analysis of the Greedy Heuristic for Independence Systems
  Annals of Discrete Mathematics, 1978
• An analysis of approximations for maximizing submodular set functions—II
  Published by Springer Nature ,1978
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
  Management Science, 1977
• Matroids and the greedy algorithm
  Mathematical Programming, 1971
• On the shortest spanning subtree of a graph and the traveling salesman problem
  Proceedings of the American Mathematical Society, 1956