A note on lower bounds for rectilinear Steiner trees

DOI10.1016/0020-0190(92)90139-MMaRDI QIDQ1198048zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3846365 (Why is no real title available?)
• scientific article; zbMATH DE number 3987367 (Why is no real title available?)
• scientific article; zbMATH DE number 192896 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• Lower bounds for rectilinear Steiner trees in bounded space
• The shortest path and the shortest road through n points

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198048)