A note on lower bounds for rectilinear Steiner trees

DOI10.1016/0020-0190(92)90139-MzbMath0769.05055OpenAlexW2059534814MaRDI QIDQ1198048

Jeffrey S. Salowe

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90139-m

zbMATH Keywords

lower boundsrectilinear Steiner trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Lower bounds for rectilinear Steiner trees in bounded space
• The shortest path and the shortest road through n points
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on lower bounds for rectilinear Steiner trees