Approximation Algorithms for ROUND-UFP and ROUND-SAP.
Debajyoti KarArindam KhanAndreas WiesePublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- approximation schemes
- open shop
- set cover
- facility location problem
- randomized algorithms
- exact algorithms
- network design problem
- np hardness
- polynomial time approximation
- constant factor
- approximation ratio
- genetic algorithm
- primal dual
- optimization problems
- constant factor approximation