Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (original) (raw)
Related papers
An improved algorithm for computing Steiner minimal trees in Euclidean -space
Discrete Optimization, 2008
An improved algorithm for computing Steiner minimal trees in Euclidean d-space
2008
Exact and heuristic algorithms for the Euclidean Steiner tree problem
2010
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
An Exact Algorithm for Steiner Tree Problem on Graphs
International Journal of Computers Communications & Control, 2006
Local search for the Steiner tree problem in the Euclidean plane
European Journal of Operational Research, 1999
Spanning Trees in Hypergraphs with Applications to Steiner Trees
On a nonconvex MINLP formulation of the Euclidean Steiner tree problems in n-space
On-line steiner trees in the Euclidean plane
Discrete & Computational Geometry, 1993
On the euclidean bottleneck full Steiner tree problem
Proceedings of the twenty-seventh annual symposium on Computational geometry, 2011
A partition-based relaxation for Steiner trees
Mathematical Programming, 2011
An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem
The Euclidean Bottleneck Full Steiner Tree Problem
Algorithmica, 2013
An Hybrid Metaheuristic Approach to Solve the Euclidean Steiner Tree Problem in R N
2013
An Effective Construction Algorithm for the Steiner Tree Problem Based on Edge Betweenness
Kenya Jinno, Takayuki Kimura, Misa Fujita
A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees
Proceedings of 4th Great Lakes Symposium on VLSI
A fast algorithm for Steiner trees
Acta Informatica, 1981
Some Formulations for the Group Steiner Tree Problem
Electronic Notes in Discrete Mathematics, 2004
A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
RAIRO - Operations Research, 2001
Directed Steiner Tree Problem on a Graph: Models, Relaxations, and Algorithms
Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics
Algorithmica, 2006
On the number of minimal 1-Steiner trees
Discrete & Computational Geometry, 1994
Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem
Algorithmica, 1999
A near linear time approximation scheme for Steiner tree among obstacles in the plane
Computational Geometry, 2010
Algorithms for terminal Steiner trees
2007
Speeding up the Dreyfus–Wagner algorithm for minimum Steiner trees
Mathematical Methods of Operations Research, 2007
A New Heuristic Constructing Minimal Steiner Trees inside Simple Polygons
Discrete Applied Mathematics, 1993
Simple and fast reoptimizations for the Steiner tree problem
Steiner trees for fixed orientation metrics
Martin Zachariasen, Marcus Brazil
Journal of Global Optimization, 2009
New algorithms for the rectilinear Steiner tree problem
IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, 1990