Deterministic O(1)-Approximation Algorithms to 1-Center Clustering with Outliers.
Shyam NarayananPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- randomized algorithms
- np hard
- outlier detection
- vertex cover
- special case
- data points
- clustering algorithm
- worst case
- k means
- minimum cost
- network design problem
- constant factor
- clustering method
- primal dual
- approximation ratio
- arbitrary shape
- approximation guarantees
- facility location problem
- open shop
- exact algorithms
- undirected graph
- set cover
- constant factor approximation
- np hardness
- precedence constraints
- combinatorial auctions
- computational complexity
- knapsack problem
- information theoretic