Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Work
Year: 2011
Type: article
Abstract: We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, we show how to build a S... more
Source: Journal of the ACM
Institutions Princeton University, University of Maryland, College Park, Humboldt-Universität zu Berlin
Cites: 44
Cited by: 86
Related to: 10
FWCI: 4.15
Citation percentile (by year/subfield): 99.99
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Life on land
Open Access status: green