Approximation algorithms for co-clustering.
Aris AnagnostopoulosAnirban DasguptaRavi KumarPublished in: PODS (2008)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- clustering algorithm
- worst case
- minimum cost
- information theoretic
- network design problem
- primal dual
- approximation ratio
- facility location problem
- approximation schemes
- open shop
- set cover
- exact algorithms
- constant factor
- np hardness
- scheduling problem
- semi supervised
- computational complexity
- search algorithm