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