An O(N2) heuristic for steiner minimal trees in E3

DOI10.1002/NET.3230260411zbMATH Open0856.90120OpenAlexW2149509209MaRDI QIDQ4894866FDOQ4894866

Authors: Rich Weiss, Minoo H. Patel, James MacGregor Smith 

Publication date: 13 November 1996

Published in: Networks (Search for Journal in Brave)

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

Recommendations

• How to find Steiner minimal trees in Euclidean \(d\)-space
• scientific article; zbMATH DE number 1302185
• On better heuristics for Steiner minimum trees
• A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space

zbMATH Keywords

heuristic algorithmsSteiner minimal treesDelaunay triangulation in 3-space

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• On the Problem of Steiner
• Disproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensions
• Title not available (Why is that?)

Cited In (6)

• Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\)
• Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions
• A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
• A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space
• Title not available (Why is that?)
• Local search for the Steiner tree problem in the Euclidean plane

This page was built for publication: An O(N²) heuristic for steiner minimal trees in E³

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894866)