The rectilinear class Steiner tree problem for intervals on two parallel lines

DOI10.1007/BF01582073zbMath0810.90127MaRDI QIDQ1327560

Edmund Ihler

Publication date: 17 April 1995

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

rectilinear Steiner tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

A catalog of Hanan grid problems, Class Steiner trees and VLSI-design

Cites Work

• Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle
• Rectilinear steiner trees: Efficient special-case algorithms
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• On Steiner’s Problem with Rectilinear Distance
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item