We present primal-dual algorithms which give a 2.4 approximation for a class of node-weighted network design problems in planar graphs, introduced by Demaine, Hajiaghayi and Klein (ICALP'09). This class includes Node-Weighted Steiner Forest problem studied recently by Moldenhauer (ICALP'11) and other node-weighted problems in planar graphs that can be expressed using (0,1)-proper functions introduced by Goemans and Williamson. We show that these problems can be equivalently formulated as feedback vertex set problems and analyze approximation factors guaranteed by different violation oracles within the primal-dual framework developed by Goemans and Williamson. © 2012 Springer-Verlag.
CITATION STYLE
Berman, P., & Yaroslavtsev, G. (2012). Primal-dual approximation algorithms for node-weighted network design in planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7408 LNCS, pp. 50–60). https://doi.org/10.1007/978-3-642-32512-0_5
Mendeley helps you to discover research relevant for your work.