Determining shortest networks in the Euclidean plane

DOI10.1017/S0004972700016427zbMath0796.05027MaRDI QIDQ4299277

No author found.

Publication date: 15 September 1994

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

embedding theoremSteiner problemNP-hardSteiner minimal treedecomposition problemregular polygonsorthogonal rectanglesgeneral Steiner polygonssymmetrisation theoremzigzag lines

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27)

Related Items (1)

Steiner minimal trees on regular polygons with centre

Cites Work

• A variational approach to the Steiner network problem
• Steiner minimal trees for regular polygons
• Some remarks on the Steiner problem
• Steiner Minimal Trees on Zig-Zag Lines
• The Complexity of Computing Steiner Minimal Trees
• Steiner Minimal Trees
• On the Efficiency of the Algorithm for Steiner Minimal Trees

This page was built for publication: Determining shortest networks in the Euclidean plane