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 条
  • [1] A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs
    Cohen-Addad, Vincent
    Pilipczuk, Marcin
    Pilipczuk, Michal
    2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), 2019, : 560 - 581
  • [2] A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
    Borradaile, Glencora
    Klein, Philip N.
    Mathieu, Claire
    ACM TRANSACTIONS ON ALGORITHMS, 2015, 11 (03)
  • [3] A polynomial-time approximation scheme for Euclidean Steiner forest
    Borradaile, Glencora
    Klein, Philip N.
    Mathieu, Claire
    PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, : 115 - +
  • [4] A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection
    Fox, Kyle
    Klein, Philip N.
    Mozes, Shay
    STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 841 - 850
  • [5] Efficient polynomial-time approximation scheme for the genus of dense graphs
    Jing, Yifan
    Mohar, Bojan
    JOURNAL OF THE ACM, 2024, 71 (06)
  • [6] Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs
    Jing, Yifan
    Mohar, Bojan
    2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2018, : 719 - 730
  • [7] A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs
    Bloch-Hansen, Andrew
    Page, Daniel R.
    Solis-Oba, Roberto
    COMBINATORIAL ALGORITHMS, IWOCA 2023, 2023, 13889 : 87 - 98
  • [8] An O(n log n) Approximation Scheme for Steiner Tree in Planar Graphs
    Borradaile, Glencora
    Klein, Philip
    Mathieu, Claire
    ACM TRANSACTIONS ON ALGORITHMS, 2009, 5 (03)
  • [9] Polynomial-time approximation schemes for geometric graphs
    Erlebach, T
    Jansen, K
    Seidel, E
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 671 - 679
  • [10] A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem
    Joonmo Kim
    Mihaela Cardei
    Ionut Cardei
    Xiaohua Jia
    Journal of Global Optimization, 2002, 24 : 437 - 448
12345