The Steiner forest problem revisited

DOI10.1016/J.JDA.2009.05.002MaRDI QIDQ972355zbMATH OpenOpenAlexFDO

Authors Elisabeth Gassner

Publication date 25 May 2010

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2009.05.002

zbMATH Keywords

outerplanar graphseries-parallel graphSteiner forestcomputational complexity analysisSteiner subgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth
• Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
• On multiple steiner subgraph problems
• Generalized steiner problem in series-parallel networks
• Generalized Steiner problem in outerplanar networks

Cites work

• scientific article; zbMATH DE number 4049084 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• scientific article; zbMATH DE number 970831 (Why is no real title available?)
• A General Approximation Technique for Constrained Forest Problems
• Graph Classes: A Survey
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs
• On multiple steiner subgraph problems
• When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

Cited in

(15)

• Exploring the gap between treedepth and vertex cover through vertex integrity
• Exploring the gap between treedepth and vertex cover through vertex integrity
• Colored Non-crossing Euclidean Steiner Forest
• Placing Green bridges optimally, with a multivariate analysis
• Stronger MIP formulations for the Steiner forest problem
• Around the Danzer problem and the construction of dense forests
• Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
• As Time Goes By: Reflections on Treewidth for Temporal Graphs
• Euclidean Prize-Collecting Steiner Forest
• Improved Steiner tree algorithms for bounded treewidth
• Grundy distinguishes treewidth from pathwidth
• On multiple steiner subgraph problems
• Placing green bridges optimally, with a multivariate analysis
• scientific article; zbMATH DE number 7053305 (Why is no real title available?)
• Grundy Distinguishes Treewidth from Pathwidth

This page was built for publication: The Steiner forest problem revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972355)