Two special cases for rectilinear Steiner minimum trees

MaRDI QIDQ4363167zbMATH OpenFDO

Authors Du Ding-Zhu, Peng-Jun Wan, E. Shragowitz

Publication date 18 December 1997

zbMATH Keywords

full componentspolynomial-time computableshortest network interconnecting points

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 8006
• Thirty‐five‐point rectilinear steiner minimal trees in a day
• Shortest trees and Steiner trees with rectilinear distances
• On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results

Cited in

(6)

• A simple proof of Hwang's theorem for rectilinear Steiner minimal trees
• Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
• Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle
• scientific article; zbMATH DE number 8006 (Why is no real title available?)
• scientific article; zbMATH DE number 512925 (Why is no real title available?)
• Shortest trees and Steiner trees with rectilinear distances

This page was built for publication: Two special cases for rectilinear Steiner minimum trees

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