Exact and Approximation Algorithms for Clustering (Extended Abstract).
Pankaj K. AgarwalCecilia Magdalena ProcopiucPublished in: SODA (1998)
Keyphrases
- extended abstract
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- clustering algorithm
- minimum cost
- k means
- facility location problem
- set cover
- randomized algorithms
- np hardness
- open shop
- constant factor
- network design problem
- primal dual
- exact algorithms
- undirected graph
- approximation ratio
- upper bound
- data points
- computational complexity
- precedence constraints
- information theoretic
- lower bound
- approximation schemes
- genetic algorithm