A constant-factor approximation algorithm for the k -median problem (extended abstract)

This publication has 13 references indexed in Scilit:

• Improved Approximation Algorithms for Uncapacitated Facility Location
  Published by Springer Nature ,1998
• Rounding via trees
  Published by Association for Computing Machinery (ACM) ,1998
• Approximation schemes for Euclidean k-medians and related problems
  Published by Association for Computing Machinery (ACM) ,1998
• An O(pn2) algorithm for the p-median and related problems on tree graphs
  Operations Research Letters, 1996
• The capacitated K-center problem
  Published by Springer Nature ,1996
• How to Allocate Network Centers
  Journal of Algorithms, 1993
• Approximation algorithms for geometric median problems
  Information Processing Letters, 1992
• A Best Possible Heuristic for the k-Center Problem
  Mathematics of Operations Research, 1985
• A simple heuristic for the p-centre problem
  Operations Research Letters, 1985
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
  SIAM Journal on Applied Mathematics, 1979