Almost Tight Approximation Algorithms for Explainable Clustering.
Hossein EsfandiariVahab S. MirrokniShyam NarayananPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- worst case
- np hard
- special case
- clustering algorithm
- vertex cover
- lower bound
- exact algorithms
- facility location problem
- minimum cost
- network design problem
- approximation ratio
- randomized algorithms
- constant factor
- set cover
- disjoint paths
- primal dual
- k means
- upper bound
- approximation schemes
- open shop
- np hardness
- undirected graph
- combinatorial auctions
- greedy algorithm
- error bounds
- polynomial time approximation
- data points
- constant factor approximation