An analysis of approximations for maximizing submodular set functions—I
Data up to Jan 2025
Total Citations Per Year
Abstract
References (14)
P-Complete Approximation Problems
1976 • 1,701 citations
Cores of convex games
1971 • 1,601 citations
An analysis of approximations for maximizing submodular set functions - 1
1978 • 879 citations
Matroids and the greedy algorithm
1971 • 879 citations
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
1977 • 807 citations
Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms”
1979 • 452 citations
An Analysis of the Greedy Heuristic for Independence Systems
1978 • 188 citations
Complements and substitutes in the opttmal assignment problem
1962 • 131 citations
Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
1975 • 120 citations
Plant Location with Generalized Search Origin
1969 • 66 citations
A cost function property for plant location problems
1974 • 46 citations
Introduction to the Theory of Matroids
1975 • 37 citations
Comments on the note of Frieze
1974 • 34 citations
Applications of polymatroids and linear programming to transversals and graphs
1974 • 5 citations
Cited By (0)
No citing papers found in database