Steiner minimal trees in \(L^ 2_ p\)

DOI10.1016/0012-365X(94)00368-SzbMath0863.05026OpenAlexW2034971340MaRDI QIDQ1923480

Johann Linhart, Dietmar Cieslik

Publication date: 28 May 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00368-s

zbMATH Keywords

Steiner pointsSteiner minimum trees\(k\)-Steiner minimum tree

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
• On Steiner minimal trees with \(L_ p\) distance
• Selected Families of Location Problems
• The 1-steiner tree problem
• The Fermat-Steiner-Weber-problem in Minkowski spaces
• Weber's problem and weiszfeld's algorithm in general spaces
• Technical Note—Minisum I_p Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
• The 1-Steiner-Minimal-Tree problem in Minkowski-spaces
• On Steiner Minimal Trees with Rectilinear Distance
• Finding Minimum Spanning Trees
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• The Complexity of Computing Steiner Minimal Trees
• On the History of the Minimum Spanning Tree Problem
• On Steiner’s Problem with Rectilinear Distance
• Steiner Minimal Trees
• Modelling Inter-city Road Distances by Mathematical Functions

This page was built for publication: Steiner minimal trees in \(L^ 2_ p\)