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

DOI10.1002/net.3230260411zbMath0856.90120OpenAlexW2149509209MaRDI QIDQ4894866

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

zbMATH Keywords

heuristic algorithmsSteiner minimal treesDelaunay triangulation in 3-space

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

Local search for the Steiner tree problem in the Euclidean plane ⋮ Iterated local search algorithms for the Euclidean Steiner tree problem inndimensions ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Disproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensions
• On the Problem of Steiner

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