Creating and exploiting flexibility in Steiner trees

被引:0
|
作者
Bozorgzadeh, E [1 ]
Kastner, R [1 ]
Sarrafzadeh, M [1 ]
机构
[1] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90095 USA
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents the concept of flexibility - a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an optimal algorithm which takes a Steiner tree and outputs a more flexible Steiner tree. Our experiments show that a net with a flexible Steiner tree increases its routability. Experiments with a global router show that congestion is improved by approximately 20%.
引用
收藏
页码:195 / 198
页数:4
相关论文
共 50 条
  • [1] Creating and exploiting flexibility in rectilinear Steiner trees
    Bozorgzadeh, E
    Kastner, R
    Sarrafzadeh, M
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2003, 22 (05) : 605 - 615
  • [2] Flexibility of Steiner trees in uniform orientation metrics
    Brazil, M
    Winter, P
    Zachariasen, M
    [J]. ALGORITHMS AND COMPUTATION, 2004, 3341 : 196 - 208
  • [3] Flexibility of steiner trees in uniform orientation metrics
    Brazil, Marcus
    Winter, Pawel
    Zachariasen, Martin
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3341 : 196 - 208
  • [4] Flexibility of steiner trees in uniform orientation metrics
    Brazil, M
    Winter, P
    Zachariasen, M
    [J]. NETWORKS, 2005, 46 (03) : 142 - 153
  • [5] Integrality ratio for Group Steiner Trees and Directed Steiner Trees
    Halperin, E
    Kortsarz, G
    Krauthgamer, R
    Srinivasan, A
    Nan, W
    [J]. PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 275 - 284
  • [6] INTEGRALITY RATIO FOR GROUP STEINER TREES AND DIRECTED STEINER TREES
    Halperin, Eran
    Kortsarz, Guy
    Krauthgamer, Robert
    Srinivasan, Aravind
    Wang, Nan
    [J]. SIAM JOURNAL ON COMPUTING, 2007, 36 (05) : 1494 - 1511
  • [7] Packing Steiner trees
    Jain, K
    Mahdian, M
    Salavatipour, MR
    [J]. PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 266 - 274
  • [8] RECTILINEAR STEINER TREES IN RECTANGLE TREES
    FARLEY, AM
    HEDETNIEMI, ST
    MITCHELL, SL
    [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (01): : 70 - 81
  • [9] On directed Steiner trees
    Zosin, L
    Khuller, S
    [J]. PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 59 - 63
  • [10] STEINER TREES FOR THE HYPERCUBE
    STEELMAN, JH
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1990, 97 (07): : 620 - 621