The Steiner forest problem revisited
type: Item
instance of: scholarly article
title: The Steiner forest problem revisited
zbMATH Open document ID: 1186.90117
author: Elisabeth Gassner
published in: Journal of Discrete Algorithms
publication date: 2010-05-25T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5711881
zbMATH Keywords: Steiner forest
zbMATH Keywords: Steiner subgraph
zbMATH Keywords: computational complexity analysis
zbMATH Keywords: series-parallel graph
zbMATH Keywords: outerplanar graph
MaRDI profile type: Publication
full work available at URL: j.jda.2009.05.002
OpenAlex ID: W2052588711
cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
cites work: Q4291429
cites work: Graph Classes: A Survey
cites work: Q4198056
cites work: A General Approximation Technique for Constrained Forest Problems
cites work: Linear algorithms to recognize outerplanar and maximal outerplanar graphs
cites work: Q5689037
cites work: On multiple steiner subgraph problems
cites work: Q3785974
DOI: 10.1016/J.JDA.2009.05.002
description: scientific article; zbMATH DE number 5711881