, Volume 38, Issue 3, pp 441–449

Improved Approximations for Tour and Tree Covers


DOI: 10.1007/s00453-003-1071-0

Cite this article as:
Könemann, J., Konjevod, G., Parekh, O. et al. Algorithmica (2004) 38: 441. doi:10.1007/s00453-003-1071-0


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 et al. give approximation algorithms with ratios 3.55 (tree cover) and 5.5 (tour cover). We present algorithms with a worst-case ratio of 3 for both problems.

Approximation algorithmsGraph algorithmsNetwork design

Copyright information

© Springer-Verlag 2003

Authors and Affiliations

  1. 1.Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA15213-3890USA
  2. 2.Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213-3890USA