Routing and scheduling on a shoreline with release times
Management Science
The shifting algorithm technique for the partitioning of trees
Discrete Applied Mathematics - Special volume on partitioning and decomposition in combinatorial optimization
A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
Discrete Applied Mathematics
(p-1)/(p+1)-approximate algorithms for p-traveling salemen problems on a tree with minmax objective
Discrete Applied Mathematics
Minmax subtree cover problem on cacti
Discrete Applied Mathematics
Minmax Tree Cover in the Euclidean Space
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Note: A note on the minimum bounded edge-partition of a tree
Discrete Applied Mathematics
Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Minmax subtree cover problem on cacti
Discrete Applied Mathematics
Locating and repairing faults in a network with mobile agents
Theoretical Computer Science
Approximation results for a min-max location-routing problem
Discrete Applied Mathematics
Power-Aware collective tree exploration
ARCS'06 Proceedings of the 19th international conference on Architecture of Computing Systems
Approximating the minmax subtree cover problem in a cactus
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.05 |
Given an edge-weighted tree T and an integer p ≥ 1, the minmax p-traveling salesmen problem on a tree T asks to find p tours such that the union of the p tours covers all the vertices. The objective is to minimize the maximum of length of the p tours. It is known that the problem is NP-hard and has a (2- 2/(p + 1))-approximation algorithm which runs in O(pp-1 np-1) time for a tree with n vertices. In this paper, we consider an extension of the problem in which the set of vertices to be covered now can be chosen as a subset S of vertices and weights to process vertices in S are also introduced in the tour length. For the problem, we give an approximation algorithm that has the same performance guarantee, but runs in O((p - 1)! . n) time.