Two variations of the minimum Steiner problem
type: Item
instance of: scholarly article
title: Two variations of the minimum Steiner problem
zbMATH Open document ID: 1066.90105
author: Kuo-Hui Tsai
author: Da-Wei Wang
author: Tsan-sheng Hsu
author: Der-Tsai Lee
published in: Journal of Combinatorial Optimization
publication date: 2005-05-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 2168269
zbMATH Keywords: minimum Steiner network
zbMATH Keywords: minimum union paths
zbMATH Keywords: directed acyclic graph
zbMATH Keywords: NP-hard
zbMATH Keywords: polynomial time
MaRDI profile type: Publication
full work available at URL: s10878-005-5487-0
OpenAlex ID: W2077016363
cites work: An integer linear programming approach to the steiner problem in graphs
cites work: Directed Steiner problems with connectivity constraints
cites work: The steiner problem in graphs
cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
cites work: Steiner's problem in graphs and its implications
cites work: Steiner tree problems
cites work: The Steiner tree problem
cites work: Finding a minimum equivalent graph of a digraph
cites work: Cost-minimal trees in directed acyclic graphs
cites work: The rectilinear Steiner arborescence problem
cites work: Worst-case performance of some heuristics for Steiner's problem in directed graphs
cites work: Steiner problem in networks: A survey
cites work: A dual ascent approach for steiner tree problems on a directed graph
DOI: 10.1007/S10878-005-5487-0
description: scientific article; zbMATH DE number 2168269