Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover.
Wei YuPublished in: Math. Methods Oper. Res. (2023)
Keyphrases
- min max
- approximation algorithms
- vertex cover
- max min
- multiobjective optimization
- np hardness
- exact algorithms
- special case
- np hard
- approximation schemes
- network design problem
- minimum cost
- randomized algorithms
- np complete
- facility location problem
- constant factor
- mixed integer
- lower bound
- optimization problems
- set cover