Advertisement

Steiner Forest

  • Vijay V. Vazirani
Chapter
  • 1.5k Downloads

Abstract

We will obtain a factor 2 approximation algorithm for the Steiner forest problem by enhancing the primal-dual schema with the idea of growing duals in a synchronized manner. The Steiner forest problem generalizes the metric Steiner tree problem, for which a factor 2 algorithm was presented in Chapter 3. Recall, however, that we had postponed giving the lower bounding method behind that algorithm; we will clarify this as well.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. [111]
    M.X. Goemans and D.P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24: 296–317, 1995.MathSciNetCrossRefGoogle Scholar
  2. [1]
    A. Agrawal, P. Klein, and R. Ravi. When trees collide: an approximation algorithm for the generalized Steiner network problem on networks. SIAM Journal on Computing, 24: 440–456, 1995.MathSciNetCrossRefGoogle Scholar
  3. [113]
    M.X. Goemans and D.P. Williamson. The primal—dual method for approximation algorithms and its applications to network design problems. In D.S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 144–191. PWS Publishing, Boston, MA, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations