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 条
  • [31] Polynomial-Time Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows
    M. Yu. Khachai
    Yu. Yu. Ogorodnikov
    Proceedings of the Steklov Institute of Mathematics, 2019, 307 : 51 - 63
  • [32] Polynomial-Time Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows
    Khachai, M. Yu.
    Ogorodnikov, Yu. Yu.
    PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2019, 307 (SUPPL 1) : 51 - 63
  • [33] A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State
    Antonios Antoniadis
    Chien-Chung Huang
    Sebastian Ott
    Algorithmica, 2019, 81 : 3725 - 3745
  • [34] A polynomial-time approximation scheme for minimum routing cost spanning trees
    Wu, BY
    Lancia, G
    Bafna, V
    Chao, KM
    Ravi, R
    Tang, CAY
    SIAM JOURNAL ON COMPUTING, 2000, 29 (03) : 761 - 778
  • [35] Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem
    Xiuzhen Cheng
    Bhaskar DasGupta
    Bing Lu
    Journal of Global Optimization, 2001, 21 : 385 - 396
  • [36] Polynomial time approximation scheme for Symmetric Rectilinear Steiner Arborescence problem
    Cheng, XZ
    DasGupta, B
    Lu, B
    JOURNAL OF GLOBAL OPTIMIZATION, 2001, 21 (04) : 385 - 396
  • [37] A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs
    Ding, Jian
    Du, Hang
    Gong, Shuyang
    RANDOM STRUCTURES & ALGORITHMS, 2024, 65 (01) : 220 - 257
  • [38] A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems
    Segev, Danny
    Shaposhnik, Yaron
    OPERATIONS RESEARCH, 2022, 70 (02) : 1153 - 1165
  • [39] Polynomial-time approximation scheme for a Euclidean problem on a cycle covering of a graph
    Khachai, M. Yu.
    Neznakhina, E. D.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2014, 20 (04): : 297 - 311
  • [40] A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
    M. Yu. Khachai
    E. D. Neznakhina
    Proceedings of the Steklov Institute of Mathematics, 2015, 289 : 111 - 125
12345