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
✦ LIBER ✦
On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results
✍ Scribed by U. Föß{}meier; M. Kaufmann
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Weight
- 271 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The Steiner tree problem for terminals o
✍
Siu-Wing Cheng
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 233 KB
An Algorithmic Framework for the Exact S
✍
Ivana Ljubić; René Weiskircher; Ulrich Pferschy; Gunnar W. Klau; Petra Mutzel; M
📂
Article
📅
2005
🏛
Springer-Verlag
🌐
English
⚖ 369 KB
On exact solutions of Stokes second prob
✍
M. Khan; Asia Anjum; C. Fetecau
📂
Article
📅
2009
🏛
Springer
🌐
English
⚖ 462 KB
The scale-up of activated carbon columns
✍
H. Spahn; E.U. Schlünder
📂
Article
📅
1975
🏛
Elsevier Science
🌐
English
⚖ 766 KB
Ah&act-Mass transfer coefficients for external and internal transport were determined using experimentally established time-concentration curves in batch tests for the adsorption of organic impurities from water on activated carbon particles. These tests revealed that the mass transfer coefficient f