Problems with generalized Steiner problems

DOI10.1007/BF01758767zbMath0756.05044MaRDI QIDQ1186806

Stefan Voß

Publication date: 28 June 1992

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

Steiner treegeneralized Steiner problems

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Chordality properties on graphs and minimal conceptual connections in semantic data models
• Generalized Steiner problem in outerplanar networks
• Steiner problem in Halin networks
• The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
• Permutation graphs: Connected domination and Steiner trees
• Steiner trees, partial 2–trees, and minimum IFI networks
• Steiner trees, connected domination and strongly chordal graphs
• The NP-completeness column: an ongoing guide
• Generalized steiner problem in series-parallel networks
• On multiple steiner subgraph problems
• Linear-time computability of combinatorial problems on series-parallel graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Problems with generalized Steiner problems