Deterministic O(1)-Approximation Algorithms to 1-Center Clustering with Outliers.
Shyam NarayananPublished in: APPROX-RANDOM (2018)
Keyphrases
- approximation algorithms
- randomized algorithms
- outlier detection
- np hard
- special case
- data points
- worst case
- vertex cover
- network design problem
- minimum cost
- clustering algorithm
- clustering method
- facility location problem
- approximation guarantees
- k means
- approximation schemes
- approximation ratio
- open shop
- exact algorithms
- primal dual
- np hardness
- undirected graph
- constant factor approximation
- information theoretic
- disjoint paths