The Steiner tree problem for terminals on the boundary of a rectilinear polygon

DOI10.1016/S0304-3975(98)00171-6zbMath0939.68090WikidataQ127814583 ScholiaQ127814583MaRDI QIDQ1566725

Siu-Wing Cheng

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Dynamic programmingHomotpic routingRectilinear Steiner tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets
• Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle
• Convexity and the Steiner tree problem
• Faster exact algorithms for steiner trees in planar networks

This page was built for publication: The Steiner tree problem for terminals on the boundary of a rectilinear polygon