On the Cycle Augmentation Problem: Hardness and Approximation Algorithms.
Waldo GálvezFabrizio GrandoniAfrouz Jabal AmeliKrzysztof SornatPublished in: WAOA (2019)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- vertex cover
- facility location problem
- minimum cost
- np complete
- network design problem
- exact algorithms
- computational complexity
- approximation ratio
- constant factor approximation
- primal dual
- set cover
- open shop
- precedence constraints
- lower bound
- upper bound
- scheduling problem
- phase transition
- information theoretic
- combinatorial auctions
- branch and bound algorithm
- error bounds
- approximation schemes
- linear programming
- integer programming