The Steiner forest problem revisited

DOI10.1016/j.jda.2009.05.002zbMath1186.90117OpenAlexW2052588711MaRDI QIDQ972355

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

series-parallel graphouterplanar graphSteiner forestcomputational complexity analysisSteiner subgraph

Mathematics Subject Classification ID

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

Related Items (9)

As Time Goes By: Reflections on Treewidth for Temporal Graphs ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Improved Steiner tree algorithms for bounded treewidth ⋮ Unnamed Item ⋮ Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ Unnamed Item ⋮ Placing Green bridges optimally, with a multivariate analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs
• On multiple steiner subgraph problems
• Graph Classes: A Survey
• A General Approximation Technique for Constrained Forest Problems
• When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

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