Approximation Algorithms for Clustering to Minimize the Sum of Diameters.
Srinivas DoddiMadhav V. MaratheS. S. RaviDavid Scot TaylorPeter WidmayerPublished in: SWAT (2000)
Keyphrases
- approximation algorithms
- np hard
- special case
- clustering algorithm
- vertex cover
- worst case
- k means
- minimum cost
- randomized algorithms
- network design problem
- facility location problem
- constant factor
- open shop
- disjoint paths
- set cover
- approximation ratio
- approximation schemes
- constant factor approximation
- polynomial time approximation
- combinatorial auctions
- search algorithm