Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers.
Sara AhmadianChaitanya SwamyPublished in: ICALP (2016)
Keyphrases
- approximation algorithms
- lower bound
- vertex cover
- worst case
- np hard
- randomized algorithms
- special case
- approximation schemes
- upper bound
- np hardness
- optimization problems
- constant factor
- clustering algorithm
- outlier detection
- exact algorithms
- open shop
- network design problem
- practical problems
- approximation guarantees
- primal dual
- strongly np hard
- combinatorial auctions
- randomly generated problems
- branch and bound
- learning algorithm