Skip to main content
SpringerLink
Log in

Improved Approximations for Tour and Tree Covers

  • Published:
Algorithmica Aims and scope Submit manuscript

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA15213-3890, USA

    Jochen Könemann

  2. Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213-3890, USA

    Goran Konjevod, Ojas Parekh & Amitabh Sinha

Authors
  1. Jochen Könemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Goran Konjevod
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ojas Parekh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Amitabh Sinha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Jochen Könemann, Goran Konjevod, Ojas Parekh or Amitabh Sinha.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Könemann, J., Konjevod, G., Parekh, O. et al. Improved Approximations for Tour and Tree Covers. Algorithmica 38, 441–449 (2004). https://doi.org/10.1007/s00453-003-1071-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-003-1071-0

Search

Navigation