Steiner tree in planar graphs:: An O(n log n) approximation scheme with singly-exponential dependence on epsilon

被引：0
|
作者：
Borradaile, Glencora [1 ]
Klein, Philip N. [1 ]
Mathieu, Claire [1 ]
机构：
[1] Brown Univ, Providence, RI 02912 USA
来源：
ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS | 2007年 / 4619卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We give an algorithm that, for any epsilon > 0, any undirected planar graph G, and any set S of nodes of G, computes a (1 + epsilon)-optimal Steiner tree in G that spans the nodes of S. The algorithm takes time O(2(poly(1/epsilon)), log n).
引用
收藏
页码：275 / +
页数：3
相关论文
共 18 条
  • [1] 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)
  • [2] A Polynomial-Time Approximation Scheme for Steiner Tree in Planar Graphs
    Borradaile, Glencora
    Kenyon-Mathieu, Claire
    Klein, Philip
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 1285 - 1294
  • [3] An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree
    Koenemann, Jochen
    Sadeghian, Sina
    Sanita, Laura
    2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 568 - 577
  • [4] Minimum Cut of Directed Planar Graphs in O(n log log n) Time
    Mozes, Shay
    Nikolaev, Kirill
    Nussbaum, Yahav
    Weimann, Oren
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 477 - 494
  • [5] AN O(N LOG N) HEURISTIC FOR STEINER MINIMAL TREE PROBLEMS ON THE EUCLIDEAN METRIC
    SMITH, JM
    LEE, DT
    LIEBMAN, JS
    NETWORKS, 1981, 11 (01) : 23 - 39
  • [6] Shortest Paths in Planar Graphs with Real Lengths in O(n log2 n/log log n) Time
    Mozes, Shay
    Wulff-Nilsen, Christian
    ALGORITHMS-ESA 2010, PT II, 2010, 6347 : 206 - +
  • [7] Nonrepetitive Colourings of Planar Graphs with O(log n) Colours
    Dujmovic, Vida
    Frati, Fabrizio
    Joret, Gwenael
    Wood, David R.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (01):
  • [8] Min-Cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time
    Lacki, Jakub
    Sankowski, Piotr
    ALGORITHMS - ESA 2011, 2011, 6942 : 155 - 166
  • [9] An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs
    Kawarabayashi, Ken-Ichi
    Kobayashi, Yusuke
    ACM TRANSACTIONS ON ALGORITHMS, 2013, 9 (02)
  • [10] Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time
    Wulff-Nilsen, Christian
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 756 - 765
12