Hostname: page-component-77c89778f8-gq7q9 Total loading time: 0 Render date: 2024-07-22T10:09:03.272Z Has data issue: false hasContentIssue false
  • English
  • Français

Approximation algorithms for metric tree cover and generalized tour and tree covers

Published online by Cambridge University Press:  21 August 2007

Viet Hung Nguyen
Viet Hung Nguyen*
Affiliation:
LIP6 - Université Pierre et Marie Curie - Paris 6, 4 place Jussieu, 75252 Paris Cedex, France; hung.nguyen@lip6.fr
Get access

Abstract

Given a weighted undirected graph G = (V,E), a tree (respectively tour) cover of an edge-weighted graph is a set of edges which forms a tree (resp. closed walk) and covers every other edge in the graph. The tree (resp. tour) cover problem is of finding a minimum weight tree (resp. tour) cover of G. Arkin, Halldórsson and Hassin (1993) give approximation algorithms with factors respectively 3.5 and 5.5. Later Könemann, Konjevod, Parekh, and Sinha (2003) study the linear programming relaxations and improve both factors to 3. We describe in the first part of the paper a 2-approximation algorithm for the metric case of tree cover. In the second part, we will consider a generalized version of tree (resp. tour) covers problem which is to find a minimum tree (resp. tours) which covers a subset D ⊆ E of G. We show that the algorithms of Könemann et al. can be adapted for the generalized tree and tours covers problem with the same factors.

Keywords

Approximation algorithmsgraph algorithmsnetwork design
Type
Research Article
Information
RAIRO - Operations Research , Volume 41 , Issue 3: Journées Polyèdres et Optimisation Combinatoire , July 2007 , pp. 305 - 315
Copyright
© EDP Sciences, ROADEF, SMAI, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Arkin, E.M., Halldórsson, M.M. and Hassin, R., Approximating the tree and tour covers of a graph. Inf. Process. Lett. 47 (1993) 275–282. CrossRef
J. Edmonds, Optimum branchings. J. Res. Nat. Bur. Stand. B 71 (1965).
M.R. Garey and D.S. Johnson, Computer and Intractablity: A Guide to the theory of the NP-Completeness, Freeman (1978).
Goemans, M.X. and Bertsimas, D.J., Survivable networks, linear programming relaxations and the parsinomious property. Math. Program. 60 (1993) 145–166. CrossRef
Y.J. Chu and T.H. Liu, On the shortest arborescence of a directed graph. Scientia Sinica 14 (1965).
Könemann, J., Konjevod, G., Parekh, O. and Sinha, A., Improved approximations for tour and tree covers. Algorithmica 38 (2003) 441–449. CrossRef
Shmoys, D.B. and Williamsons, D.P., Analyzing the help-karp tsp bound: a monotonicity property with application. Inf. Process. Lett. 35 (1990) 281–285. CrossRef
V.V. Vazirani and S. Rajagopalan, On the bidirected cut relaxation for metric bidirected steiner tree problem, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (1999) 742–751.
Wolsey, L.A., Heuristic analysis, linear programming and branch-and-bound. Math. Program. Stud. 13 (1980) 121–134. CrossRef