Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs-Reference-Cited by-同舟云学术

Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs

Published:2013-01 Issue: Volume:222 Page:293-306
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Moldenhauer Carsten

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference31 articles.

1. When trees collide: An approximation algorithm for the generalized Steiner problem on networks;Agrawal;SIAM Journal on Computing,1995

2. Spyros Angelopoulos, The node-weighted Steiner problem in graphs of restricted node weights, in: Algorithm Theory – SWAT 2006, vol. 4059, 2006, pp. 208–219.

3. Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs;Bafna;Algorithms and Computations,1995

4. Local ratio: A unified framework for approximation algorithms. In memoriam: Shimon Even 1935–2004;Bar-Yehuda;ACM Computing Surveys,2004

5. MohammadHossein Bateni, Chandra Chekuri, Alina Ene, MohammadTaghi Hajiaghayi, Nitish Korula, Dániel Marx, Prize-collecting Steiner problems on planar graphs, in: 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hitting Weighted Even Cycles in Planar Graphs;SIAM Journal on Discrete Mathematics;2022-11-14

2. Node-weighted Network Design in Planar and Minor-closed Families of Graphs;ACM Transactions on Algorithms;2021-06

3. Approximating Node-Weighted k-MST on Planar Graphs;Theory of Computing Systems;2020-02-03

4. PTAS for Steiner Tree on Map Graphs;LATIN 2020: Theoretical Informatics;2020

5. Approximating Node-Weighted k-MST on Planar Graphs;Approximation and Online Algorithms;2018