Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle
From MaRDI portal
Publication:3487159
DOI10.1002/net.3230200407zbMath0706.90088MaRDI QIDQ3487159
Pankaj K. Agarwal, Man-tak Shing
Publication date: 1990
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230200407
90C35: Programming involving graphs or networks
05C05: Trees
90C60: Abstract computational complexity for mathematical programming problems
90C39: Dynamic programming
Related Items
Fast heuristic algorithms for rectilinear Steiner trees, A simple proof of Hwang's theorem for rectilinear Steiner minimal trees, A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets, The point-to-point delivery and connection problems: Complexity and algorithms, The rectilinear class Steiner tree problem for intervals on two parallel lines, The Steiner tree problem in orientation metrics, The Steiner tree problem for terminals on the boundary of a rectilinear polygon