Approximation algorithms for the restricted k-Chinese postman problems with penalties.
Pengxiang PanHongtao ZhuPublished in: Optim. Lett. (2024)
Keyphrases
- approximation algorithms
- vertex cover
- np hard
- np hardness
- approximation schemes
- worst case
- exact algorithms
- randomized algorithms
- network design problem
- special case
- practical problems
- facility location problem
- approximation ratio
- set cover
- minimum cost
- optimization problems
- search algorithm
- branch and bound algorithm
- quadratic program
- mathematical model
- scheduling problem
- search space