A constant-factor approximation algorithm for the k -median problem (extended abstract)
- 1 May 1999
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Improved Approximation Algorithms for Uncapacitated Facility LocationLecture Notes in Computer Science, 1998
- Rounding via treesPublished by Association for Computing Machinery (ACM) ,1998
- Approximation schemes for Euclidean k-medians and related problemsPublished by Association for Computing Machinery (ACM) ,1998
- An O(pn2) algorithm for the p-median and related problems on tree graphsOperations Research Letters, 1996
- The capacitated K-center problemLecture Notes in Computer Science, 1996
- How to Allocate Network CentersJournal of Algorithms, 1993
- Approximation algorithms for geometric median problemsInformation Processing Letters, 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
- An Algorithmic Approach to Network Location Problems. II: Thep-MediansSIAM Journal on Applied Mathematics, 1979