Approximation Algorithms for Label Cover and The Log-Density Threshold.
Eden ChlamtácPasin ManurangsiDana MoshkovitzAravindan VijayaraghavanPublished in: SODA (2017)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- minimum cost
- set cover
- worst case
- network design problem
- facility location problem
- exact algorithms
- precedence constraints
- np hardness
- multi label
- primal dual
- constant factor
- open shop
- undirected graph
- randomized algorithms
- disjoint paths
- convex hull
- approximation ratio
- approximation schemes
- linear programming
- constant factor approximation