Primal-dual approximation algorithms for node-weighted steiner forest on planar graphs

  • Authors:

  • Carsten Moldenhauer

  • Affiliations:

  • Humboldt-Universität zu Berlin, Institut für Informatik, Berlin, Germany

  • Venue:
  • ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

NODE-WEIGHTED STEINER FOREST is the following problem: Given an undirected graph, a set of pairs of terminal vertices, a weight function on the vertices, find a minimum weight set of vertices that includes and connects each pair of terminals. We consider the restriction to planar graphs where the problem remains NP-complete. Demaine et al. [DHK09] showed that the generic primal-dual algorithm of Goemans andWilliamson [GW97] is a 6-approximation on planar graphs. We present (1) a different analysis to prove an approximation factor of 3, (2) show that this bound is tight for the generic algorithm, and (3) show how the algorithm can be improved to yield a 9/4-approximation algorithm. We give a simple proof for the first result using contraction techniques and present an example for the lower bound. Then, we establish a connection to the feedback problems studied by Goemans and Williamson [GW98]. We show how our constructions can be combined with their proof techniques yielding the third result and an alternative, more involved, way of deriving the first result. The third result induces an upper bound on the integrality gap of 9/4. Our analysis implies that improving this bound for NODE-WEIGHTED STEINER FOREST via the primal-dual algorithm is essentially as difficult as improving the integrality gap for the feedback problems in [GW98].