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.
Cite
CITATION STYLE
Könemann, J., Konjevod, G., Parekh, O., & Sinha, A. (2000). Improved approximations for tour and tree covers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1913, pp. 184–193). Springer Verlag. https://doi.org/10.1007/3-540-44436-x_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
