On the Steiner tree problem in lambda(3)-metric

被引:0
|
作者
Li, YY
Cheung, SK
Leung, KS
Wong, CK
机构
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We consider Steiner minimal trees (SMT) in metrics defined by given orientations. The problem is motivated by wiring consideration of VLSI chips when the wiring direction is not restricted to only horizontal and vertical. In particular, we concentrate on the case when the given orientations form angles of 0 degrees, 60 degrees and 120 degrees (lambda(3)-metric) since many interesting results can be obtained, which may shed light on other metrics in the family. Specifically, we show that any SMT can be transformed to one with their Steiner points located on the grid points of a multilevel grid, where the number of levels is at most inverted right perpindicular n-2/2 inverted left perpindicular, n being the number of input points. Based on this result, we have developed a Simulated Annealing(SA)-based algorithm to generate near-optimal SMT's. Empirical results compared with Euclidean cases are also given.
引用
收藏
页码:1564 / 1567
页数:4
相关论文
共 50 条
  • [1] Query Complexity of the Metric Steiner Tree Problem
    Chen, Yu
    Khanna, Sanjeev
    Tan, Zihan
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 4893 - 4935
  • [2] The 1-Steiner tree problem in lambda-3 geometry plane
    Lin, GH
    Thurber, AP
    Xue, GL
    ISCAS '99: PROCEEDINGS OF THE 1999 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 6: CIRCUITS ANALYSIS, DESIGN METHODS, AND APPLICATIONS, 1999, : 125 - 128
  • [3] On the bidirected cut relaxation for the metric Steiner tree problem
    Rajagopalan, S
    Vazirani, VV
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 742 - 751
  • [4] Steiner tree constructions in λ3-metric
    Li, YY
    Cheung, SK
    Leung, KS
    Wong, CK
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING, 1998, 45 (05): : 563 - 574
  • [5] On the low-dimensional Steiner minimum tree problem in Hamming metric
    Althaus, Ernst
    Kupilas, Joschka
    Naujoks, Rouven
    THEORETICAL COMPUTER SCIENCE, 2013, 505 : 2 - 10
  • [6] On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
    Althaus, Ernst
    Kupilas, Joschka
    Naujoks, Rouven
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 2011, 6648 : 308 - 319
  • [7] New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
    Deeparnab Chakrabarty
    Nikhil R. Devanur
    Vijay V. Vazirani
    Mathematical Programming, 2011, 130 : 1 - 32
  • [8] New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
    Chakrabarty, Deeparnab
    Devanur, Nikhil R.
    Vazirani, Vijay V.
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 2008, 5035 : 344 - +
  • [9] New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
    Chakrabarty, Deeparnab
    Devanur, Nikhil R.
    Vazirani, Vijay V.
    MATHEMATICAL PROGRAMMING, 2011, 130 (01) : 1 - 32
  • [10] CONVEXITY AND THE STEINER TREE PROBLEM
    PROVAN, JS
    NETWORKS, 1988, 18 (01) : 55 - 72