Approximation Algorithms for Clustering to Minimize the Sum of Diameters.
Srinivas DoddiMadhav V. MaratheS. S. RaviDavid Scot TaylorPeter WidmayerPublished in: Nord. J. Comput. (2000)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- clustering algorithm
- k means
- minimum cost
- network design problem
- primal dual
- constant factor
- disjoint paths
- facility location problem
- open shop
- similarity function
- undirected graph
- precedence constraints
- integrality gap
- completion times
- np hardness
- set cover
- approximation ratio
- data points
- approximation schemes
- constant factor approximation
- polynomial time approximation
- randomized algorithms
- valid inequalities
- linear programming
- objective function