Approximation Algorithms for Clique Clustering.
Marek ChrobakChristoph DürrBengt J. NilssonPublished in: CoRR (2014)
Keyphrases
- approximation algorithms
- np hard
- special case
- clustering algorithm
- minimum cost
- vertex cover
- set cover
- approximation ratio
- open shop
- worst case
- constant factor
- network design problem
- np hardness
- k means
- facility location problem
- randomized algorithms
- primal dual
- approximation schemes
- precedence constraints
- undirected graph
- combinatorial auctions
- lower bound