Back to search
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
Data up to Jan 2025
Published1980
Citations49
References7
Total Citations Per Year
Abstract
References (7)
An analysis of approximations for maximizing submodular set functions—I
1978 • 4,300 citations
On the Computational Complexity of Combinatorial Problems
1975 • 683 citations
Best Algorithms for Approximating the Maximum of a Submodular Set Function
1978 • 555 citations
Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms”
1979 • 452 citations
On colouring random graphs
1975 • 367 citations
Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
1981 • 134 citations
Minimum node covers and 2-bicritical graphs
1979 • 39 citations
Cited By (0)
Loading...