Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants.
Liting HuangWei YuZhaohui LiuPublished in: Algorithmica (2024)
Keyphrases
- approximation algorithms
- min max
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- facility location problem
- max min
- network design problem
- primal dual
- approximation ratio
- open shop
- exact algorithms
- set cover
- polynomial time approximation
- np hardness
- constant factor
- randomized algorithms
- approximation schemes
- undirected graph
- np complete
- disjoint paths