Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers.
Sara AhmadianChaitanya SwamyPublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- lower bound
- np hard
- vertex cover
- randomized algorithms
- approximation schemes
- worst case
- exact algorithms
- outlier detection
- network design problem
- np hardness
- upper bound
- special case
- clustering algorithm
- minimum cost
- approximation ratio
- branch and bound
- optimization problems
- combinatorial auctions
- open shop
- facility location problem
- primal dual
- search space
- optimal solution