Abstract
A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree (closed walk) and covers every other edge in the graph.
Arkin, Halldórsson and Hassin (Information Processing Letters 47:275-282, 1993) give approximation algorithms with ratio 3.55 (tree cover) and 5.5 (tour cover). We present algorithms with worst-case ratio 3 for both problems.
Supported in part by the W. L. Mellon Fellowship.
Supported in part by the NSF CAREER grant CCR-9625297.
Supported in part by the W. L. Mellon Fellowship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. M. Arkin, M. M. Halldórsson, and R. Hassin. Approximating the tree and tour covers of a graph. Information Processing Letters, 47:275–282, 1993.
D. Bienstock, M. X. Goemans, D. Simchi-Levi, and D. Williamson. A note on the prize collecting traveling salesman problem. Math. Programming, 59:413–420, 1993.
R. D. Carr, T. Fujito, G. Konjevod, and O. Parekh. A 2 1/10-approximation algorithm for a generalization of the weighted edge-dominating set problem. In procof ”ESA’ 00”, 2000.
L. Fleischer. Approximating fractional multicommodity flow independent of the number of commodities. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 24–31, 1999.
N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 300–309, 1998.
M. X. Goemans and D. J. Bertsimas. Survivable networks, linear programming relaxations and the parsimonious property. Math. Programming, 60:145–166, 1993.
M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer, 1988.
G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 770–779, 2000.
D. B. Shmoys and D. P. Williamson. Analyzing the Held-Karp TSP bound: a monotonicity property with application. Information Processing Letters, 35:281–285, 1990.
V. V. Vazirani and S. Rajagopalan. On the bidirected cut relaxation for the metric Steiner tree problem. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 742–751, 1999.
L. A. Wolsey. Heuristic analysis, linear programming and branch and bound. Math. Programming Stud., 13:121–134, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Könemann, J., Konjevod, G., Parekh, O., Sinha, A. (2000). Improved Approximations for Tour and Tree Covers. In: Jansen, K., Khuller, S. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2000. Lecture Notes in Computer Science, vol 1913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44436-X_19
Download citation
DOI: https://doi.org/10.1007/3-540-44436-X_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67996-7
Online ISBN: 978-3-540-44436-7
eBook Packages: Springer Book Archive