Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Approximation Algorithms for Combinatorial Optimization

APPROX 2000: Approximation Algorithms for Combinatorial Optimization pp 184–193Cite as

Improved Approximations for Tour and Tree Covers

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1913))

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.

Supported in part by the W. L. Mellon Fellowship.

Supported in part by the NSF CAREER grant CCR-9625297.

Supported in part by the W. L. Mellon Fellowship.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. M. Arkin, M. M. Halldórsson, and R. Hassin. Approximating the tree and tour covers of a graph. Information Processing Letters, 47:275–282, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Bienstock, M. X. Goemans, D. Simchi-Levi, and D. Williamson. A note on the prize collecting traveling salesman problem. Math. Programming, 59:413–420, 1993.

    Article  MathSciNet  Google Scholar 

  3. R. D. Carr, T. Fujito, G. Konjevod, and O. Parekh. A 2 1/10-approximation algorithm for a generalization of the weighted edge-dominating set problem. In procof ”ESA’ 00”, 2000.

    Google Scholar 

  4. L. Fleischer. Approximating fractional multicommodity flow independent of the number of commodities. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 24–31, 1999.

    Google Scholar 

  5. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 300–309, 1998.

    Google Scholar 

  6. M. X. Goemans and D. J. Bertsimas. Survivable networks, linear programming relaxations and the parsimonious property. Math. Programming, 60:145–166, 1993.

    Article  MathSciNet  Google Scholar 

  7. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer, 1988.

    Google Scholar 

  8. G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 770–779, 2000.

    Google Scholar 

  9. D. B. Shmoys and D. P. Williamson. Analyzing the Held-Karp TSP bound: a monotonicity property with application. Information Processing Letters, 35:281–285, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  10. V. V. Vazirani and S. Rajagopalan. On the bidirected cut relaxation for the metric Steiner tree problem. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 742–751, 1999.

    Google Scholar 

  11. L. A. Wolsey. Heuristic analysis, linear programming and branch and bound. Math. Programming Stud., 13:121–134, 1980.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 15213-3890

    Jochen Könemann & Amitabh Sinha

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

    Goran Konjevod & Ojas Parekh

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

Editor information

Editors and Affiliations

  1. Christian-Albrechts-Universität zu Kiel Institut für Informatik und praktische Mathematik Olshausenstr, 40, 24098, Kiel, Germany

    Klaus Jansen

  2. Computer Science Department, University of Maryland, A.V. Williams Bldg College Park, MD 20742, USA

    Samir Khuller

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Könemann, J., Konjevod, G., Parekh, O., Sinha, A. (2000). Improved Approximations for Tour and Tree Covers. In: Jansen, K., Khuller, S. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2000. Lecture Notes in Computer Science, vol 1913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44436-X_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-44436-X_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67996-7

  • Online ISBN: 978-3-540-44436-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation