论文信息 - Improved approximations for tour and tree covers

Improved approximations for tour and tree covers

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, Halldorsson 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.

Ojas Parekh | Amitabh Sinha | Jochen Könemann | Goran Konjevod

[1] David P. Williamson,et al. A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[2] Michel X. Goemans,et al. Survivable networks, linear programming relaxations and the parsimonious property , 1993, Math. Program..

[3] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .

[4] L. Wolsey. Heuristic analysis, linear programming and branch and bound , 1980 .

[5] David P. Williamson,et al. Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application , 1990, Inf. Process. Lett..

[6] Lisa Fleischer,et al. Approximating fractional multicommodity flow independent of the number of commodities , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[7] Robert D. Carr,et al. A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem , 2000, ESA.

[8] Esther M. Arkin,et al. Approximating the Tree and Tour Covers of a Graph , 1993, Inf. Process. Lett..

[9] Alex Zelikovsky,et al. Improved Steiner tree approximation in graphs , 2000, SODA '00.

[10] Vijay V. Vazirani,et al. On the bidirected cut relaxation for the metric Steiner tree problem , 1999, SODA '99.

[11] Jochen Könemann,et al. Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).