A simple proof of the planar rectilinear Steiner ratio

DOI10.1016/0167-6377(92)90053-6zbMath0773.90086OpenAlexW2025686398MaRDI QIDQ1200801

Jeffrey S. Salowe

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90053-6

zbMATH Keywords

heuristicsdistance algorithmstree algorithmsrectilinear minimum spanning treerectilinear Steiner ratio

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

\(1\)-line minimum rectilinear Steiner trees and related problems

Cites Work

• A simple proof of Hwang's theorem for rectilinear Steiner minimal trees
• A proof of the Gilbert-Pollak conjecture on the Steiner ratio
• An 11/6-approximation algorithm for the network Steiner problem
• On Steiner Minimal Trees with Rectilinear Distance
• Unnamed Item

This page was built for publication: A simple proof of the planar rectilinear Steiner ratio