Min-max tree covers of graphs

  title={Min-max tree covers of graphs},
  author={Guy Even and Naveen Garg and Jochen K{\"o}nemann and R. Ravi and Amitabh Sinha},
  journal={Oper. Res. Lett.},
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. 
Highly Influential
This paper has highly influenced 17 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 85 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
50 Extracted Citations
7 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 50 extracted citations

85 Citations

Citations per Year
Semantic Scholar estimates that this publication has 85 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-7 of 7 references

Graph Theory

  • R. Diestel
  • Springer-Verlag, Berlin
  • 2000
2 Excerpts

Analysis of heuristics for vehicle routing problems

  • M. Haimovich, A. Rinnooy Kan, L. Stougie
  • B.L. Golden and A.A. Assad (editors), Vehicle…
  • 1988
1 Excerpt

Similar Papers

Loading similar papers…