Some remarks on the Steiner problem

DOI10.1016/0097-3165(78)90058-4zbMath0392.05021OpenAlexW2094076885MaRDI QIDQ1251668

H. O. Pollak

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(78)90058-4

zbMATH Keywords

TreeMinimal NetworkShortest Total LengthSteiner Problem

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of finite geometries (05B25)

Related Items (39)

Symmetrization theorem of full Steiner trees ⋮ Some results on greedy algorithm conjectures ⋮ Variational approach and Steiner minimal trees on four points ⋮ A continuous version of a result of Du and Hwang ⋮ Steiner minimal trees on sets of four points ⋮ On greedy heuristic for Steiner minimum trees ⋮ The Steiner problem on a surface ⋮ Full minimal Steiner trees on lattice sets ⋮ A decomposition theorem on Euclidean Steiner minimal trees ⋮ Determining shortest networks in the Euclidean plane ⋮ Non-crossing of plane minimal spanning and minimal T1 networks ⋮ Analytic deformations of minimal networks ⋮ Bifurcations of Steiner tree topologies in the plane ⋮ A New Bound for the Steiner Ratio ⋮ Geometry and topology of local minimal 2-trees ⋮ Steiner Minimal Trees on Zig-Zag Lines ⋮ Euclidean Steiner trees optimal with respect to swapping 4-point subtrees ⋮ Analytic formulas for full Steiner trees ⋮ The Steiner ratio conjecture for six points ⋮ A primer of the Euclidean Steiner problem ⋮ The Steiner ratio for five points ⋮ On Steiner ratio conjectures ⋮ The Steiner ratio conjecture for cocircular points ⋮ A proof of the Gilbert-Pollak conjecture on the Steiner ratio ⋮ On Steiner minimal trees with \(L_ p\) distance ⋮ Graham's problem on shortest networks for points on a circle ⋮ Steiner minimal trees for a class of zigzag lines ⋮ ON CHARACTERISTIC AREA OF STEINER TREE ⋮ On the history of the Euclidean Steiner tree problem ⋮ On better heuristics for Steiner minimum trees ⋮ A faster approximation algorithm for the Steiner problem in graphs ⋮ Steiner minimal trees for bar waves ⋮ A Ginzburg-Landau model with topologically induced free discontinuities ⋮ Bifurcations of binary types of Steiner minimal networks in the plane ⋮ Partial regularity for the optimal \(p\)-compliance problem with length penalization ⋮ IDENTIFYING STEINER MINIMAL TREES ON FOUR POINTS IN SPACE ⋮ A short proof of a result of Pollak on Steiner minimal trees ⋮ The Steiner ratio conjecture is true for five points ⋮ A variational approach to the Steiner network problem

Cites Work

• Unnamed Item
• On the Problem of Steiner
• The Complexity of Computing Steiner Minimal Trees
• Steiner Minimal Trees
• A Conjecture of Gilbert and Pollak on Minimal Trees

This page was built for publication: Some remarks on the Steiner problem