The Steiner forest problem revisited
From MaRDI portal
Publication:972355
DOI10.1016/J.JDA.2009.05.002zbMATH Open1186.90117OpenAlexW2052588711MaRDI QIDQ972355FDOQ972355
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
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
outerplanar graphseries-parallel graphSteiner forestcomputational complexity analysisSteiner subgraph
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- Title not available (Why is that?)
- A General Approximation Technique for Constrained Forest Problems
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- On multiple steiner subgraph problems
Cited In (15)
- Grundy Distinguishes Treewidth from Pathwidth
- Placing Green bridges optimally, with a multivariate analysis
- Stronger MIP formulations for the Steiner forest problem
- Euclidean Prize-Collecting Steiner Forest
- Title not available (Why is that?)
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
- Colored Non-crossing Euclidean Steiner Forest
- Around the Danzer problem and the construction of dense forests
- On multiple steiner subgraph problems
- Placing green bridges optimally, with a multivariate analysis
- Improved Steiner tree algorithms for bounded treewidth
- Title not available (Why is that?)
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Exploring the gap between treedepth and vertex cover through vertex integrity
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
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)
