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 条
  • [41] A Polynomial-Time Approximation Scheme for the Euclidean Problem on a Cycle Cover of a Graph
    Khachai, M. Yu.
    Neznakhina, E. D.
    PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2015, 289 : S111 - S125
  • [42] A fully polynomial-time approximation scheme for approximating a sum of random variables
    Li, Jian
    Shi, Tianlin
    OPERATIONS RESEARCH LETTERS, 2014, 42 (03) : 197 - 202
  • [43] Steiner tree in planar graphs:: An O(n log n) approximation scheme with singly-exponential dependence on epsilon
    Borradaile, Glencora
    Klein, Philip N.
    Mathieu, Claire
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2007, 4619 : 275 - +
  • [44] A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State
    Antoniadis, Antonios
    Huang, Chien-Chung
    Ott, Sebastian
    ALGORITHMICA, 2019, 81 (09) : 3725 - 3745
  • [45] A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology
    Guoliang Xue
    Wei Xiao
    Algorithmica , 2005, 41 : 53 - 72
  • [46] From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
    Chekuri, Chandra
    Jain, Rhea
    Kulkarni, Shubhang
    Zheng, Da Wei
    Zhu, Weihao
    Leibniz International Proceedings in Informatics, LIPIcs, 308
  • [47] Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
    Demaine, Erik D.
    Hajiaghayi, MohammadTaghi
    Klein, Philip N.
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 328 - +
  • [48] Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
    Demaine, Erik D.
    Hajiaghayi, Mohammadtaghi
    Klein, Philip N.
    ACM TRANSACTIONS ON ALGORITHMS, 2014, 10 (03)
  • [49] A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology
    Xue, GL
    Xiao, W
    ALGORITHMICA, 2005, 41 (01) : 53 - 72
  • [50] RECOGNIZING CIRCLE GRAPHS IN POLYNOMIAL-TIME
    GABOR, CP
    SUPOWIT, KJ
    HSU, WL
    JOURNAL OF THE ACM, 1989, 36 (03) : 435 - 473
12345