Clustering to minimize the sum of cluster diameters

This publication has 10 references indexed in Scilit:

• Approximating min-sum k -clustering in metric spaces
  Published by Association for Computing Machinery (ACM) ,2001
• A constant-factor approximation algorithm for the k -median problem (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1999
• Approximation algorithms for min-sum p-clustering
  Discrete Applied Mathematics, 1998
• Improved Approximation Algorithms for Uncapacitated Facility Location
  Published by Springer Nature ,1998
• Incremental clustering and dynamic information retrieval
  Published by Association for Computing Machinery (ACM) ,1997
• Approximation algorithms for facility location problems (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1997
• 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