Recognizing outerplanar graphs in linear time
International Workshop WG '86 on Graph-theoretic concepts in computer science
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Graph classes: a survey
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
Proceedings of the forty-second ACM symposium on Theory of computing
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
Supporting queries spanning across phases of evolving artifacts using Steiner forests
Proceedings of the 20th ACM international conference on Information and knowledge management
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved steiner tree algorithms for bounded treewidth
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Improved Steiner tree algorithms for bounded treewidth
Journal of Discrete Algorithms
| Hi-index | 0.00 |
The Steiner Forest Problem (SFP for short) is a natural generalization of the classical Steiner Tree Problem. Instead of only one terminal net there is given a set of terminal nets that have to be connected by choosing edges at minimum cost. Richey and Parker [M.B. Richey, R.G. Parker, On multiple Steiner subgraph problems, Networks 16 (4) (1986) 423-438] posed the question whether SFP is hard on series-parallel graphs. We partially answer this question by showing that SFP is strongly NP-hard on graphs with treewidth 3. On the other hand, a quadratic time algorithm for the special case on outerplanar graphs is suggested. Since series-parallel graphs have treewidth 2 and outerplanar graphs are series-parallel, we almost close the gap between polynomially solvable and hard cases.