Improved Approximation Algorithms for Steiner Connectivity Augmentation Problems.
Daniel HathcockMichael ZlatinPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- vertex cover
- np hard
- randomized algorithms
- np hardness
- minimum cost
- exact algorithms
- special case
- approximation schemes
- facility location problem
- worst case
- network design problem
- np complete
- open shop
- set cover
- approximation ratio
- quadratic program
- constant factor
- optimization problems
- computational complexity