Approximation algorithms for projective clustering.
Pankaj K. AgarwalCecilia Magdalena ProcopiucPublished in: J. Algorithms (2003)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- clustering algorithm
- vertex cover
- minimum cost
- clustering method
- set cover
- network design problem
- approximation ratio
- facility location problem
- primal dual
- open shop
- exact algorithms
- k means
- undirected graph
- precedence constraints
- constant factor
- approximation schemes
- constant factor approximation
- lower bound
- polynomial time approximation
- randomized algorithms