A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs
Shayan Oveis GharanLuca TrevisanPublished in: CoRR (2012)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- minimum cost
- vertex cover
- worst case
- primal dual
- approximation ratio
- approximation schemes
- approximation guarantees
- set cover
- network design problem
- graph matching
- facility location problem
- spanning tree
- exact algorithms
- open shop
- randomized algorithms
- polynomial time approximation
- optimal solution
- disjoint paths
- precedence constraints
- constant factor
- planar graphs
- weighted graph