A Polynomial-Time Approximation Scheme for Steiner Tree in Planar Graphs

被引：0
|
作者：
Borradaile, Glencora [1 ]
Kenyon-Mathieu, Claire [1 ]
Klein, Philip [1 ]
机构：
[1] Brown Univ, Dept Comp Sci, Providence, RI 02912 USA
来源：
PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2007年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We give an O(n log n) approximation scheme for Steiner tree in planar graphs.
引用
收藏
页码：1285 / 1294
页数：10
相关论文
共 50 条
  • [21] A polynomial-time approximation scheme for maximizing the minimum machine completion time
    Woeginger, GJ
    OPERATIONS RESEARCH LETTERS, 1997, 20 (04) : 149 - 154
  • [22] Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem
    Bing Lu
    Lu Ruan
    Journal of Combinatorial Optimization, 2000, 4 : 357 - 363
  • [23] Polynomial time approximation scheme for the rectilinear Steiner arborescence problem
    Lu, B
    Ruan, L
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2000, 4 (03) : 357 - 363
  • [24] A DETERMINISTIC POLYNOMIAL-TIME APPROXIMATION SCHEME FOR COUNTING KNAPSACK SOLUTIONS
    Stefankovic, Daniel
    Vempala, Santosh
    Vigoda, Eric
    SIAM JOURNAL ON COMPUTING, 2012, 41 (02) : 356 - 366
  • [25] Structure of Polynomial-Time Approximation
    van Leeuwen, Erik Jan
    van Leeuwen, Jan
    THEORY OF COMPUTING SYSTEMS, 2012, 50 (04) : 641 - 674
  • [26] Improved Steiner tree approximation in graphs
    Robins, G
    Zelikovsky, A
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 770 - 779
  • [27] The complexity of polynomial-time approximation
    Cai, Liming
    Fellows, Michael
    Juedes, David
    Rosamond, Frances
    THEORY OF COMPUTING SYSTEMS, 2007, 41 (03) : 459 - 477
  • [28] The Complexity of Polynomial-Time Approximation
    Liming Cai
    Michael Fellows
    David Juedes
    Frances Rosamond
    Theory of Computing Systems, 2007, 41 : 459 - 477
  • [29] Structure of Polynomial-Time Approximation
    Erik Jan van Leeuwen
    Jan van Leeuwen
    Theory of Computing Systems, 2012, 50 : 641 - 674
  • [30] Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
    Dyer, Martin
    Heinrich, Marc
    Jerrum, Mark
    Mueller, Haiko
    COMBINATORICS PROBABILITY AND COMPUTING, 2021, 30 (06) : 905 - 921
12345