On the Cycle Augmentation Problem: Hardness and Approximation Algorithms.
Waldo GálvezFabrizio GrandoniAfrouz Jabal AmeliKrzysztof SornatPublished in: Theory Comput. Syst. (2021)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- minimum cost
- special case
- facility location problem
- vertex cover
- primal dual
- computational complexity
- open shop
- np complete
- scheduling problem
- network design problem
- undirected graph
- set cover
- disjoint paths
- optimal solution
- approximation ratio
- information theoretic
- approximation schemes
- constant factor
- lower bound
- precedence constraints
- exact algorithms
- linear programming
- phase transition
- error bounds
- resource allocation
- integer programming
- constraint satisfaction problems
- approximation guarantees
- randomized algorithms
- knapsack problem
- branch and bound algorithm
- constant factor approximation