Cited in
(29)- On the location of Steiner points in uniformly-oriented Steiner trees.
- The Daikon system for dynamic detection of likely invariants
- Optimal Steiner hull algorithm
- Computing Euclidean Steiner trees over segments
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- On the history of the Euclidean Steiner tree problem
- Delay-related secondary objectives for rectilinear Steiner minimum trees.
- Rotationally optimal spanning and Steiner trees in uniform orientation metrics
- New pruning rules for the Steiner tree problem and 2-connected Steiner network problem
- Implications, conflicts, and reductions for Steiner trees
- Implications, conflicts, and reductions for Steiner trees
- scientific article; zbMATH DE number 1947438 (Why is no real title available?)
- A robust and scalable algorithm for the Steiner problem in graphs
- SteinLib
- FindSteinerTree
- Treewidthlib
- ParaXpress
- SCIP-Jack
- A convex approach to the Gilbert-Steiner problem
- A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
- scientific article; zbMATH DE number 1982172 (Why is no real title available?)
- Bounding the expected number of rectilinear full Steiner trees
- Approximate Euclidean Steiner trees
- Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Numerical calibration of Steiner trees
- Shortest paths and Steiner trees in VLSI routing
- Variational approximation of functionals defined on 1-dimensional connected sets: the planar case
- Tropical geometric variation of tree shapes
- On Steiner trees and minimum spanning trees in hypergraphs
This page was built for software: GeoSteiner
