GeoSteiner

swMATH4320MaRDI QIDQ16499FDOQ16499

Author name not available (Why is that?)

Described by source

• The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study

Cited In (24)

• On the location of Steiner points in uniformly-oriented Steiner trees.
• The Daikon system for dynamic detection of likely invariants
• Optimal Steiner hull algorithm
• Speeding Up Dynamic Programming with Representative Sets
• 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
• Title not available (Why is that?)
• Variational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar Case
• A robust and scalable algorithm for the Steiner problem in graphs
• A convex approach to the Gilbert-Steiner problem
• Title not available (Why is that?)
• A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
• Bounding the expected number of rectilinear full Steiner trees
• Approximate Euclidean Steiner trees
• Numerical calibration of Steiner trees
• Shortest paths and Steiner trees in VLSI routing
• Tropical geometric variation of tree shapes
• On Steiner trees and minimum spanning trees in hypergraphs

This page was built for software: GeoSteiner