Exact and Approximation Algorithms for Clustering.
Pankaj K. AgarwalCecilia Magdalena ProcopiucPublished in: Algorithmica (2002)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- clustering algorithm
- primal dual
- facility location problem
- set cover
- approximation ratio
- minimum cost
- open shop
- np hardness
- information theoretic
- k means
- constant factor approximation
- randomized algorithms
- exact algorithms
- undirected graph
- approximation schemes
- precedence constraints
- constant factor
- combinatorial auctions
- approximation guarantees
- disjoint paths
- search algorithm