Min-max tree covers of graphs

Authors:
G. Even;N. Garg;J. KöNemann;R. Ravi;A. Sinha
Affiliations:
Tel-Aviv University, Tel-Aviv, Israel;Indian Institute of Technology, Delhi, India;GSIA, Carnegie Mellon University, Pittsburgh, USA;GSIA, Carnegie Mellon University, Pittsburgh, USA;GSIA, Carnegie Mellon University, Pittsburgh, USA
Venue:
Operations Research Letters
Year:
2004

Citing 4
Cited 14

Approximation algorithms for min-max tree partition

Journal of Algorithms
The vehicle routing problem

The vehicle routing problem
The k-traveling repairman problem

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximations for minimum and min-max vehicle routing problems

Journal of Algorithms

A plant location guide for the unsure

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for a facility location problem with service capacities

ACM Transactions on Algorithms (TALG)
Covering Directed Graphs by In-Trees

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Minmax Tree Cover in the Euclidean Space

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Multiple UAV exploration of an unknown region

Annals of Mathematics and Artificial Intelligence
Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm

Annals of Mathematics and Artificial Intelligence
Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximation algorithms for min-max capacitated path covers

CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Covering directed graphs by in-trees

Journal of Combinatorial Optimization
Multirobot forest coverage for weighted and unweighted terrain

IEEE Transactions on Robotics
Capacitated vehicle routing with non-uniform speeds

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Approximation results for a min-max location-routing problem

Discrete Applied Mathematics
Smart robot teams exploring sparse trees

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Approximation hardness of min-max tree covers

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide constant factor approximation algorithms for covering the nodes of a graph using trees (rooted or unrooted), under the objective function of minimizing the weight of the maximum weight tree, subject to an upper bound on the number of trees used. These problems are related to location routing and traveling salesperson problems.