Approximation Algorithms for Round-UFP and Round-SAP.
Debajyoti KarArindam KhanAndreas WiesePublished in: ESA (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- open shop
- set cover
- network design problem
- approximation ratio
- primal dual
- worst case
- minimum cost
- exact algorithms
- facility location problem
- lower bound
- undirected graph
- constant factor
- randomized algorithms
- polynomial time approximation
- resource allocation
- constant factor approximation