Accelerated greedy algorithms for maximizing submodular set functions
Top Cited Papers
- 29 September 2005
- book chapter
- Published by Springer Nature
- p. 234-243
- https://doi.org/10.1007/bfb0006528
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Some theoretical implications of local optimizationMathematical Programming, 1976
- Multiflots de coût minimal avec fonctions de coût concavesAnnals of Telecommunications, 1976
- Network Design with Fixed and Variable Cost ElementsTransportation Science, 1973
- Exact and approximate solutions to the multisource weber problemMathematical Programming, 1972
- On the fixed cost flow problem†International Journal of Control, 1972
- The Transportation-Location ProblemOperations Research, 1972
- Matroids and the greedy algorithmMathematical Programming, 1971
- The fixed charge problemNaval Research Logistics Quarterly, 1970
- Fixed‐cost transportation problemsNaval Research Logistics Quarterly, 1961
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956