The 1-Steiner-Minimal-Tree problem in Minkowski-spaces

DOI10.1080/02331939108843669zbMath0739.05029OpenAlexW1996594811MaRDI QIDQ3978585

Dietmar Cieslik

Publication date: 25 June 1992

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939108843669

zbMATH Keywords

Minkowski-spaceSteiner-Minimal-Tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Geometry and structure of normed linear spaces (46B20) Other problems of combinatorial convexity (52A37)

Related Items (4)

Steiner minimal trees in \(L^ 2_ p\) ⋮ Low-degree minimal spanning trees in normed spaces ⋮ Degree bounded bottleneck spanning trees in three dimensions ⋮ New lower bounds for the Hadwiger numbers of \(\ell_p\) balls for \(p<2\)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Über Treffanzahlen bei translationsgleichen Eikörpern
• On a conjecture of H. Hadwiger
• An Introduction to the Geometry of Numbers
• The 1-steiner tree problem
• The Fermat-Steiner-Weber-problem in Minkowski spaces
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Finding Minimum Spanning Trees
• An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• The Complexity of Computing Steiner Minimal Trees
• Steiner Minimal Trees

This page was built for publication: The 1-Steiner-Minimal-Tree problem in Minkowski-spaces