๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals

โœ Scribed by Feldman, Jon; Ruhl, Matthias

Book ID
118180443
Publisher
Society for Industrial and Applied Mathematics
Year
2006
Tongue
English
Weight
285 KB
Volume
36
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Steiner tree problem for terminals o
The Steiner tree problem for terminals on the boundary of a rectilinear polygon
โœ Siu-Wing Cheng ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 233 KB

Given a simple rectilinear polygon P with k sides and n terminals on its boundary, we present an O(k 3 n)-time algorithm to compute the minimal rectilinear Steiner tree lying inside P interconnecting the terminals. We obtain our result by proving structural properties of a selective set of minimal S