Approximation algorithms for two clustered arc routing problems.
Xiaoguang BaoXinhao NiPublished in: J. Comb. Optim. (2024)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- primal dual
- set cover
- minimum cost
- approximation ratio
- network design problem
- open shop
- exact algorithms
- np hardness
- approximation schemes
- randomized algorithms
- disjoint paths
- precedence constraints
- combinatorial auctions
- constant factor
- undirected graph
- upper bound
- computational complexity
- lower bound