Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\)

DOI10.1016/S0166-218X(96)00064-9zbMath0881.92022MaRDI QIDQ5961625

James MacGregor Smith, Badri Toppur

Publication date: 21 April 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

Steiner treesEuclidean Graph embedding problemminimum energy configurations

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Biochemistry, molecular biology (92C40)

Related Items (2)

Approximate Euclidean Steiner trees ⋮ Algorithmic aspects of Steiner convexity and enumeration of Steiner trees

Uses Software

• FindSteinerTree

Cites Work

• Unnamed Item
• Unnamed Item
• Euclidean minimum spanning trees and bichromatic closest pairs
• Minimal length tree networks on the unit sphere
• A proof of the Gilbert-Pollak conjecture on the Steiner ratio
• How to find Steiner minimal trees in Euclidean \(d\)-space
• On the Steiner ratio in 3-space
• Disproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensions
• Steiner Minimal Trees on Zig-Zag Lines
• Steiner problem in networks: A survey
• An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
• A Lower Bound for the Steiner Tree Problem
• Steiner Trees for Ladders
• The Complexity of Computing Steiner Minimal Trees
• Steiner Minimal Trees

This page was built for publication: Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\)