Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class.
Erik D. DemaineTimothy D. GoodrichKyle KlosterBrian LavalleeQuanquan C. LiuBlair D. SullivanAli VakilianAndrew van der PoelPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- np hard
- undirected graph
- special case
- vertex cover
- minimum cost
- approximation ratio
- facility location problem
- np hardness
- open shop
- worst case
- randomized algorithms
- approximation schemes
- exact algorithms
- network design problem
- approximation guarantees
- polynomial time approximation
- disjoint paths
- set cover
- precedence constraints
- np complete
- lower bound
- computational complexity
- bipartite graph
- linear programming
- scheduling problem
- search algorithm
- optimal solution