GeoSteiner - MaRDI portal

Cited in

(29)

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

This page was built for software: GeoSteiner