A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs.
Shayan Oveis GharanLuca TrevisanPublished in: Theory Comput. (2015)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- exact algorithms
- network design problem
- precedence constraints
- approximation ratio
- set cover
- approximation guarantees
- primal dual
- weighted graph
- facility location problem
- constant factor
- randomized algorithms
- approximation schemes
- combinatorial auctions
- open shop
- lower bound
- edit distance
- disjoint paths