An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs

被引：10
|
作者：
Kawarabayashi, Ken-Ichi [1 ]
Kobayashi, Yusuke [2 ]
机构：
[1] Res Org Informat & Syst, Natl Inst Informat, Chiyoda Ku, Tokyo 1018430, Japan
[2] Univ Tokyo, Bunkyo Ku, Tokyo 1138656, Japan
来源：
ACM TRANSACTIONS ON ALGORITHMS | 2013年 / 9卷 / 02期
基金：
日本学术振兴会;
关键词：
Edge-disjoint paths; approximation algorithm; Eulerian graph; 4-edge-connected graph; MULTICOMMODITY FLOWS; APPROXIMATION ALGORITHMS; CONGESTION; HARDNESS;
D O I：
10.1145/2438645.2438648
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this article, we study an approximation algorithm for the maximum edge-disjoint paths problem. In this problem, we are given a graph and a collection of pairs of vertices, and the objective is to find the maximum number of pairs that can be connected by edge-disjoint paths. We give an O(log n)-approximation algorithm for the maximum edge-disjoint paths problem when an input graph is either 4-edge-connected planar or Eulerian planar. This improves an O(log(2) n)-approximation algorithm given by Kleinberg [2005] for Eulerian planar graphs. Our result also generalizes the result by Chekuri et al. [2004, 2005] who gave an O(log n)-approximation algorithm for the maximum edge-disjoint paths problem with congestion two when an input graph is planar.
引用
收藏
页数：13
相关论文
共 50 条
  • [31] Edge-disjoint maximal planar graphs
    Boswell, SG
    Simpson, J
    DISCRETE MATHEMATICS, 1998, 179 (1-3) : 235 - 241
  • [32] The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
    Kawarabayashi, Ken-ichi
    Kobayashi, Yusuke
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 345 - +
  • [33] An approximation algorithm for the disjoint paths problem in even-degree planar graphs
    Kleinberg, J
    46th Annual IEEE Symposium on Foundations of Computer Science, Proceedings, 2005, : 627 - 636
  • [34] A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
    Babenko, Maxim A.
    Kolesnichenko, Ignat I.
    Razenshteyn, Ilya P.
    SOFSEM 2010: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2010, 5901 : 165 - 175
  • [35] Greedy edge-disjoint paths in complete graphs
    Carmi, P
    Erlebach, T
    Okamoto, Y
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2003, 2880 : 143 - 155
  • [36] On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary
    Werner Schwärzler
    Combinatorica, 2009, 29 : 121 - 126
  • [37] Breaking O(n1/2)-Approximation Algorithms for the Edge-Disjoint Paths Problem with Congestion Two
    Kawarabayashi, Ken-ichi
    Kobayashi, Yusuke
    STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 81 - 88
  • [38] On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary
    Schwaerzler, Werner
    COMBINATORICA, 2009, 29 (01) : 121 - 126
  • [39] Approximation Algorithms for the Edge-Disjoint Paths Problem via Racke Decompositions
    Andrews, Matthew
    2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2010, : 277 - 286
  • [40] Edge-disjoint odd cycles in planar graphs
    Král, D
    Voss, HJ
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 90 (01) : 107 - 120
12345