ALGORITHMS FOR SPECIAL CASES OF RECTILINEAR STEINER TREES .1. POINTS ON THE BOUNDARY OF A RECTILINEAR RECTANGLE

被引：10

作者：

AGARWAL, PK ^{[1
]}

SHING, MT ^{[1
]}

机构：

[1] USN,POSTGRAD SCH,DEPT COMP SCI,MONTEREY,CA 93943

来源：

NETWORKS | 1990年 / 20卷 / 04期

关键词：

D O I：

10.1002/net.3230200407

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The general rectilinear Steiner tree problem has been proved to be NP‐complete. In this paper, we consider a special case in which the points lie on the boundary of a rectilinear rectangle and give an O(n) algorithm to construct a minimum rectilinear Steiner tree for such points. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company

引用

页码：453 / 485

页数：33

共 50 条

[41] Approximation algorithms for the rectilinear Steiner tree problem with obstacles
Fujimoto, M
Takafuji, D
Watanabe, T
2005 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), VOLS 1-6, CONFERENCE PROCEEDINGS, 2005, : 1362 - 1365
[42] Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
Cambazard, Hadrien
Catusse, Nicolas
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 270 (02) : 419 - 429
[43] The Steiner tree problem for terminals on the boundary of a rectilinear polygon
Cheng, SW
THEORETICAL COMPUTER SCIENCE, 2000, 237 (1-2) : 213 - 238
[44] Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
Ganley, JL
DISCRETE APPLIED MATHEMATICS, 1999, 90 (1-3) : 161 - 171
[45] FAST VICINITY-UPGRADE ALGORITHM FOR RECTILINEAR STEINER TREES
CHUA, JK
LIM, YC
ELECTRONICS LETTERS, 1991, 27 (13) : 1139 - 1141
[46] A PROBABLY FAST, PROVABLY OPTIMAL ALGORITHM FOR RECTILINEAR STEINER TREES
DENEEN, LL
SHUTE, GM
THOMBORSON, CD
RANDOM STRUCTURES & ALGORITHMS, 1994, 5 (04) : 535 - 557
[47] Construction of All Rectilinear Steiner Minimum Trees on the Hanan Grid
Lin, Sheng-En David
Kim, Dae Hyun
PROCEEDINGS OF THE 2018 INTERNATIONAL SYMPOSIUM ON PHYSICAL DESIGN (ISPD'18), 2018, : 18 - 25
[48] Minimum rectilinear Steiner tree of n points in the unit square
Dumitrescu, Adrian
Jiang, Minghui
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2018, 68 : 253 - 261
[49] Fast optimal algorithms for the minimum rectilinear Steiner arborescence problem
Leung, KS
Cong, J
ISCAS '97 - PROCEEDINGS OF 1997 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I - IV: CIRCUITS AND SYSTEMS IN THE INFORMATION AGE, 1997, : 1568 - 1571
[50] Balancing Steiner minimum trees and shortest-path trees in the rectilinear plane
Lin, GH
Xue, GL
ISCAS '99: PROCEEDINGS OF THE 1999 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 6: CIRCUITS ANALYSIS, DESIGN METHODS, AND APPLICATIONS, 1999, : 117 - 120

← 1 2 3 4 5 →