Computing Optimal Steiner Trees in Polynomial Space

被引：0
|
作者：
Fedor V. Fomin
Fabrizio Grandoni
Dieter Kratsch
Daniel Lokshtanov
Saket Saurabh
机构：
[1] University of Bergen,Department of Informatics
[2] University of Italian Switzerland,IDSIA
[3] Université Paul Verlaine – Metz,LITA
[4] Taramani,The Institute of Mathematical Sciences
来源：
Algorithmica | 2013年 / 65卷
关键词：
Steiner tree; Exact algorithms; Space complexity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Given an n-node edge-weighted graph and a subset of k terminal nodes, the NP-hard (weighted) Steiner tree problem is to compute a minimum-weight tree which spans the terminals. All the known algorithms for this problem which improve on trivial O(1.62n)-time enumeration are based on dynamic programming, and require exponential space.
引用
收藏
页码：584 / 604
页数：20
相关论文
共 50 条
  • [1] Computing Optimal Steiner Trees in Polynomial Space
    Fomin, Fedor V.
    Grandoni, Fabrizio
    Kratsch, Dieter
    Lokshtanov, Daniel
    Saurabh, Saket
    [J]. ALGORITHMICA, 2013, 65 (03) : 584 - 604
  • [2] Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
    Ganley, JL
    [J]. DISCRETE APPLIED MATHEMATICS, 1999, 90 (1-3) : 161 - 171
  • [3] CLOSING THE GAP - NEAR-OPTIMAL STEINER TREES IN POLYNOMIAL-TIME
    GRIFFITH, J
    ROBINS, G
    SALOWE, JS
    ZHANG, TT
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1994, 13 (11) : 1351 - 1365
  • [4] An improved algorithm for computing Steiner minimal trees in Euclidean d-space
    Fampa, Marcia
    Anstreicher, Kurt M.
    [J]. DISCRETE OPTIMIZATION, 2008, 5 (02) : 530 - 540
  • [5] COMPLEXITY OF COMPUTING STEINER MINIMAL TREES
    GAREY, MR
    GRAHAM, RL
    JOHNSON, DS
    [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1977, 32 (04) : 835 - 859
  • [6] Optimal and approximate bottleneck Steiner trees
    Ganley, JL
    Salowe, JS
    [J]. OPERATIONS RESEARCH LETTERS, 1996, 19 (05) : 217 - 224
  • [7] On the configuration space of Steiner minimal trees
    Edelsbrunner, H.
    Strelkova, N. P.
    [J]. RUSSIAN MATHEMATICAL SURVEYS, 2012, 67 (06) : 1167 - 1168
  • [8] Computing Euclidean Steiner trees over segments
    Althaus, Ernst
    Rauterberg, Felix
    Ziegler, Sarah
    [J]. EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2020, 8 (3-4) : 309 - 325
  • [9] Computing Steiner Minimum Trees in Hamming Metric
    Althaus, Ernst
    Naujoks, Rouven
    [J]. PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 172 - +
  • [10] NEAR OPTIMAL BOUNDS FOR STEINER TREES IN THE HYPERCUBE
    Jiang, Tao
    Miller, Zevi
    Pritikin, Dan
    [J]. SIAM JOURNAL ON COMPUTING, 2011, 40 (05) : 1340 - 1360
12345