Minimum weight 2-edge-connected spanning subgraphs in planar graphs

被引：0
|
作者：
Berger, Andre [1 ]
Grigni, Michelangelo [2 ]
机构：
[1] Tech Univ Berlin, Inst Math, Axel Springer Str 54A, D-10623 Berlin, Germany
[2] Emory Clin, Dept Math & Comp Sci, Atlanta, GA 30322 USA
来源：
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS | 2007年 / 4596卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We present a linear time algorithm exactly solving the 2-edge connected spanning subgraph (2-ECSS) problem in a graph of bounded treewidth. Using this with Klein's diameter reduction technique [15], we find a linear time PTAS for the problem in unweighted planar graphs, and the first PTAS for the problem in weighted planar graphs.
引用
收藏
页码：90 / +
页数：3
相关论文
共 50 条
  • [1] Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs
    Xiangwen Li
    Chunxiang Wang
    Qiong Fan
    Zhaohong Niu
    Liming Xiong
    [J]. Graphs and Combinatorics, 2013, 29 : 275 - 280
  • [2] Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs
    Li, Xiangwen
    Wang, Chunxiang
    Fan, Qiong
    Niu, Zhaohong
    Xiong, Liming
    [J]. GRAPHS AND COMBINATORICS, 2013, 29 (02) : 275 - 280
  • [3] Smallest 2-edge-connected graphs without a spanning trail
    Niu, Zhaohong
    Xiong, Liming
    Zhang, Shumin
    [J]. UTILITAS MATHEMATICA, 2012, 88 : 381 - 397
  • [4] Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs
    Berger, A
    Czumaj, A
    Grigni, M
    Zhao, HR
    [J]. ALGORITHMS - ESA 2005, 2005, 3669 : 472 - 483
  • [5] Cycle Covers of Planar 2-Edge-Connected Graphs
    D. W. Barnette
    [J]. Graphs and Combinatorics, 1997, 13 : 315 - 323
  • [6] Cycle covers of planar 2-edge-connected graphs
    Barnette, DW
    [J]. GRAPHS AND COMBINATORICS, 1997, 13 (04) : 315 - 323
  • [7] Connected spanning subgraphs of 3-connected planar graphs
    Enomoto, H
    Iida, T
    Ota, K
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1996, 68 (02) : 314 - 323
  • [8] 2-CONNECTED SPANNING SUBGRAPHS OF PLANAR 3-CONNECTED GRAPHS
    BARNETTE, DW
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1994, 61 (02) : 210 - 216
  • [9] A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs
    Beyer, Stephan
    Chimani, Markus
    Spoerhase, Joachim
    [J]. COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 347 - 359
  • [10] ON SPANNING SUBGRAPHS OF 4-CONNECTED PLANAR GRAPHS
    ROSENFELD, M
    [J]. DISCRETE APPLIED MATHEMATICS, 1989, 25 (03) : 279 - 287
12345