Steiner tree problems
From MaRDI portal
Publication:1187352
DOI10.1007/BF01758766zbMATH Open0773.05042MaRDI QIDQ1187352FDOQ1187352
Authors: Warren D. Smith, Peter W. Shor 
Publication date: 28 June 1992
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
- Steiner tree problems
- The Steiner tree problem
- scientific article; zbMATH DE number 1182759
- scientific article; zbMATH DE number 4010182
- Solving Steiner tree problems in graphs to optimality
- scientific article; zbMATH DE number 3871417
- Approaches to the Steiner Problem in Networks
- The Steiner connectivity problem
- A constrained Steiner tree problem
- The full Steiner tree problem
Cited In (24)
- Dynamic Steiner Tree Problem
- Degenerate Gilbert—Steiner trees
- The Steiner traveling salesman problem and its extensions
- The Fermat star of binary trees
- Problem reduction methods and a tree generation algorithm for the steiner network problem
- The Steiner tree problem in \(\lambda_5\)-geometry. I
- On the clustered Steiner tree problem
- On greedy heuristic for Steiner minimum trees
- The Steiner tree problem
- On the edge capacitated Steiner tree problem
- Some results on greedy algorithm conjectures
- Approaches to the Steiner Problem in Networks
- On characteristic area of Steiner tree
- Steiner's problem in graphs: Heuristic methods
- The Gilbert and Pollak conjecture—a generalization
- The role of Steiner hulls in the solution to Steiner tree problems
- Directed Steiner problems with connectivity constraints
- The 1-steiner tree problem
- An example of an infinite Steiner tree connecting an uncountable set
- Multi-Level Steiner Trees.
- Diameter-constrained Steiner trees
- Title not available (Why is that?)
- Combination algorithms for Steiner tree variants
- Title not available (Why is that?)
This page was built for publication: Steiner tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1187352)
