A Constant-Factor Approximation Algorithm for the k-Median Problem
Top Cited Papers
- 1 August 2002
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 65 (1) , 129-149
- https://doi.org/10.1006/jcss.2002.1882
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Analysis of a Local Search Heuristic for Facility Location ProblemsJournal of Algorithms, 2000
- The Capacitated K-Center ProblemSIAM Journal on Discrete Mathematics, 2000
- Greedy Strikes Back: Improved Facility Location AlgorithmsJournal of Algorithms, 1999
- How to Allocate Network CentersJournal of Algorithms, 1993
- Approximation algorithms for geometric median problemsInformation Processing Letters, 1992
- e-approximations with minimum packing constraint violation (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- A Best Possible Heuristic for the k-Center ProblemMathematics of Operations Research, 1985
- A simple heuristic for the p-centre problemOperations Research Letters, 1985
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985
- An Algorithmic Approach to Network Location Problems. II: Thep-MediansSIAM Journal on Applied Mathematics, 1979