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