Skip to main content
Springer Nature Link
Log in

A \(\frac{3}{2}\) Approximation for a Constrained Forest Problem

  • Conference paper
Algorithms – ESA 2011 (ESA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6942))

Included in the following conference series:

  • 2671 Accesses

Abstract

We want to find a forest of minimal weight such that each component of this forest is of size at least p. In this paper, we improve the best approximation ratio of \(2-\frac{1}{|V|}\) for this problem obtained by Goemans and Williamson in 1995 to \(\frac{3}{2}\) with a greedy algorithm.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bazgan, C., Couëtoux, B., Tuza, Z.: Complexity and approximation of the constrained forest problem. Theoretical Computer Science (to appear, 2011)

    Google Scholar 

  2. Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. Society for Industrial and Applied Mathematics 1(24), 296–317 (1995)

    MathSciNet  MATH  Google Scholar 

  3. Guttmann-Beck, N., Hassin, R.: Approximation algorithms for minimum tree partition. Discrete Applied Mathematics 87(1-3), 117–137 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Imielinska, C., Kalantari, B., Khachiyan, L.: A greedy heristic for a minmum-weight forest problem. Operations Research Letters 1(14), 65–71 (1993)

    Article  MATH  Google Scholar 

  5. Laszlo, M., Mukherjee, S.: Another greedy heuristic for the constrained forest problem. Mathematical Programming 1(33), 629–633 (2005)

    MathSciNet  MATH  Google Scholar 

  6. Laszlo, M., Mukherjee, S.: A class of heuristics for the constrained forest problem. Discrete Applied Mathematics 1(154), 6–14 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Monnot, J., Toulouse, S.: The path partition problem and related problems in bipartite graphs. Operations Research Letters 1(35), 677–684 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lamsade, Université Paris-Dauphine, France

    Basile Couëtoux

Authors
  1. Basile Couëtoux
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, University of Rome " La Sapienza", via Ariosto 25, 00185, Roma, Italy

    Camil Demetrescu

  2. School of Computer Science, Reykjavik University, Menntavegur 1, 101, Reykjavik, Iceland

    Magnús M. Halldórsson

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Couëtoux, B. (2011). A \(\frac{3}{2}\) Approximation for a Constrained Forest Problem. In: Demetrescu, C., Halldórsson, M.M. (eds) Algorithms – ESA 2011. ESA 2011. Lecture Notes in Computer Science, vol 6942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23719-5_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23719-5_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23718-8

  • Online ISBN: 978-3-642-23719-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics