On Steiner minimal trees with \(L_ p\) distance

DOI10.1007/BF01758757zbMath0752.05024OpenAlexW2041586232MaRDI QIDQ1186795

Zi-Cheng Liu, Ding-Zhu Du

Publication date: 28 June 1992

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01758757

zbMATH Keywords

boundsSteiner pointsSteiner minimal treesspanning treesSteiner ratio

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05)

Related Items (6)

A tight lower bound for the Steiner ratio in Minkowski planes ⋮ The Steiner ratio for the dual normed plane ⋮ Steiner minimal trees in \(L^ 2_ p\) ⋮ Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane ⋮ Minimum Steiner trees in normed planes ⋮ The Steiner Minimal Tree problem in the λ-geometry plane

Cites Work

• The Steiner ratio conjecture is true for five points
• The Steiner ratio conjecture for six points
• On Steiner ratio conjectures
• Some remarks on the Steiner problem
• A New Bound for the Steiner Ratio
• On Steiner Minimal Trees with Rectilinear Distance
• A Lower Bound for the Steiner Tree Problem
• Steiner Minimal Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: On Steiner minimal trees with \(L_ p\) distance