An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric

DOI10.1002/net.3230110104zbMath0459.68032OpenAlexW2022150791MaRDI QIDQ3910011

No author found.

Publication date: 1981

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230110104

zbMATH Keywords

algorithmtriangulationdecompositionVoronoi diagram

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Exact computation of Steiner minimal trees in the plane, Two-level rectilinear Steiner trees, On the Steiner ratio in 3-space, Short trees in polygons, Steiner minimal trees in \(L^ 2_ p\), On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem, A primer of the Euclidean Steiner problem, Minimal length tree networks on the unit sphere, Steiner minimal trees for three points with one convex polygonal obstacle, How to find Steiner minimal trees in Euclidean \(d\)-space, Improved computation of plane Steiner minimal trees, The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study, A heuristic for Euclidean and rectilinear Steiner problems, Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\), Local search for the Steiner tree problem in the Euclidean plane, A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\), Vehicle routing with a sparse feasibility graph, Heuristic methods and applications: A categorized survey, Digital data networks design using genetic algorithms, Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs, A neural network for the Steiner minimal tree problem

Cites Work

• On the Problem of Steiner