Exact and approximation algorithms for the min-max k-traveling salesmen problem on a tree.
Liang XuZhou XuDongsheng XuPublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- approximation algorithms
- min max
- np hard
- special case
- minimum cost
- max min
- worst case
- exact algorithms
- facility location problem
- network design problem
- open shop
- vertex cover
- primal dual
- approximation ratio
- tree structure
- traveling salesman problem
- set cover
- undirected graph
- spanning tree
- limited capacity
- constant factor
- scheduling problem
- approximation schemes
- polynomial time approximation
- combinatorial auctions
- randomized algorithms
- approximation guarantees
- optimal solution
- disjoint paths