Approximation algorithms for projective clustering.
Pankaj K. AgarwalCecilia Magdalena ProcopiucPublished in: SODA (2000)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- clustering algorithm
- k means
- exact algorithms
- minimum cost
- primal dual
- set cover
- network design problem
- clustering method
- approximation ratio
- facility location problem
- randomized algorithms
- open shop
- disjoint paths
- approximation schemes
- constant factor
- data points
- computational complexity