Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
Refael HassinShlomi RubinsteinPublished in: Oper. Res. Lett. (2003)
Keyphrases
- approximation algorithms
- clustering algorithm
- intra cluster
- np hard
- hierarchical clustering
- data clustering
- cluster analysis
- clustering framework
- special case
- overlapping clusters
- worst case
- k means
- clustering method
- minimum cost
- vertex cover
- primal dual
- cluster centers
- clustering approaches
- data points
- clustering quality
- network design problem
- distance metric
- approximation ratio
- cluster membership
- disjoint clusters
- open shop
- facility location problem
- randomized algorithms
- data objects
- set cover
- integrality gap
- approximation schemes
- constant factor approximation
- approximation guarantees
- constant factor
- np hardness
- combinatorial auctions
- document clustering
- spectral clustering
- arbitrary shape
- undirected graph
- disjoint paths
- distance measure
- computational complexity
- search algorithm