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.
Unable to display preview. Download preview PDF.
- 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