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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Könemann, Jochen, Konjevod, Goran, Parekh, Ojas, Sinha, Amitabh
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Algorithms for functional approximation Applied sciences Approximations and expansions Electronics Exact sciences and technology Function theory, analysis Hardware Linear Programming Relaxation Mathematical methods in physics Numerical approximation and analysis Physics Steiner Tree Steiner Tree Problem Tree Cover Vertex Cover
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0302-9743 1611-3349
DOI:	10.1007/3-540-44436-X_19