Approximation algorithms for solving the heterogeneous Chinese postman problem.
Jianping LiPengxiang PanJunran LichenLijian CaiWencheng WangSuding LiuPublished in: J. Comb. Optim. (2023)
Keyphrases
- approximation algorithms
- np hard
- quadratic program
- special case
- worst case
- minimum cost
- vertex cover
- facility location problem
- exact algorithms
- network design problem
- approximation ratio
- primal dual
- precedence constraints
- randomized algorithms
- strongly np hard
- approximation schemes
- set cover
- constant factor
- undirected graph
- open shop
- polynomial time approximation
- combinatorial auctions
- tabu search algorithm
- approximation guarantees
- np hardness
- scheduling problem
- disjoint paths