Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
Top Cited Papers
- 1 March 2001
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 48 (2) , 274-296
- https://doi.org/10.1145/375827.375845
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Improved Approximation Algorithms for Uncapacitated Facility LocationPublished by Springer Nature ,1998
- A primal-dual approximation algorithm for generalized steiner network problemsCombinatorica, 1995
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on NetworksSIAM Journal on Computing, 1995
- A General Approximation Technique for Constrained Forest ProblemsSIAM Journal on Computing, 1995
- Approximation algorithms for geometric median problemsInformation Processing Letters, 1992
- Heuristics for the fixed cost median problemMathematical Programming, 1982
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981
- A Plant and Warehouse Location ProblemJournal of the Operational Research Society, 1977
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- A Working Model for Plant Numbers and LocationsJournal of Farm Economics, 1963