Approximating the tree and tour covers of a graph

Esther M. Arkin*, Magnús M. Halldórsson, Rafael Hassin

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

The tree and tour cover problems on an edge-weighted graph are to compute a minimum weight tree and closed walk, respectively, whose vertices from a vertex cover. Both problems are NP-hard. In this note we give strongly polynomial time, constant factor approximation algorithms for both problems. An interesting feature of our algorithms is how they combine approximations of other problems, namely the weighted vertex cover, traveling salesman, and Steiner tree problems.

Original languageEnglish
Pages (from-to)275-282
Number of pages8
JournalInformation Processing Letters
Volume47
Issue number6
DOIs
StatePublished - 18 Oct 1993

Keywords

  • Algorithms
  • analysis of algorithms
  • combinatorial problems

Fingerprint

Dive into the research topics of 'Approximating the tree and tour covers of a graph'. Together they form a unique fingerprint.

Cite this