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 条
  • [31] Rectilinear group Steiner trees and applications in VLSI design
    Martin Zachariasen
    André Rohe
    Mathematical Programming, 2003, 94 : 407 - 433
  • [32] 1-line minimum rectilinear steiner trees and related problems
    Li, Jianping
    Lichen, Junran
    Wang, Wencheng
    Yeh, Jean
    Yeh, YeongNan
    Yu, Xingxing
    Zheng, Yujie
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (04) : 2832 - 2852
  • [33] ObSteiner: An Exact Algorithm for the Construction of Rectilinear Steiner Minimum Trees in the Presence of Complex Rectilinear Obstacles
    Huang, Tao
    Young, Evangeline F. Y.
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2013, 32 (06) : 882 - 893
  • [34] Bounding the Expected Number of Rectilinear Full Steiner Trees
    Wulff-Nilsen, Christian
    NETWORKS, 2010, 56 (01) : 1 - 10
  • [35] AN ALGORITHM FOR EXACT RECTILINEAR STEINER TREES FOR SWITCHBOX WITH OBSTACLES
    CHIANG, C
    SARRAFZADEH, M
    WONG, CK
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 1992, 39 (06): : 446 - 455
  • [36] LOWER BOUNDS FOR RECTILINEAR STEINER TREES IN BOUNDED SPACE
    SNYDER, TL
    INFORMATION PROCESSING LETTERS, 1991, 37 (02) : 71 - 74
  • [37] Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
    Fomin, Fedor, V
    Lokshtanov, Daniel
    Kolay, Sudeshna
    Panolan, Fahad
    Saurabh, Saket
    ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (02)
  • [38] Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
    U. Fößmeier
    M. Kaufmann
    A. Zelikovsky
    Discrete & Computational Geometry, 1997, 18 : 93 - 109
  • [39] Faster approximation algorithms for the rectilinear Steiner tree problem
    Fossmeier, U
    Kaufmann, M
    Zelikovsky, A
    DISCRETE & COMPUTATIONAL GEOMETRY, 1997, 18 (01) : 93 - 109
  • [40] 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
12345