Approximation Algorithms for Clustering via Weighted Impurity Measures.
Ferdinando CicaleseEduardo Sany LaberPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- np hard
- clustering algorithm
- special case
- vertex cover
- minimum cost
- worst case
- facility location problem
- network design problem
- k means
- approximation schemes
- set cover
- np hardness
- primal dual
- approximation ratio
- disjoint paths
- constant factor approximation
- randomized algorithms
- combinatorial auctions
- open shop
- undirected graph
- data points