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 条
  • [41] An optimal adaptive stabilizing algorithm for two edge-disjoint paths problem
    Karaata, Mehmet Hakan
    Alazemi, Fawaz M.
    JOURNAL OF SUPERCOMPUTING, 2017, 73 (03): : 1257 - 1273
  • [42] An optimal adaptive stabilizing algorithm for two edge-disjoint paths problem
    Mehmet Hakan Karaata
    Fawaz M. Alazemi
    The Journal of Supercomputing, 2017, 73 : 1257 - 1273
  • [43] Optimal construction of edge-disjoint paths in random graphs
    Broder, AZ
    Frieze, AM
    Suen, S
    Upfal, E
    SIAM JOURNAL ON COMPUTING, 1998, 28 (02) : 542 - 574
  • [44] EXISTENCE AND CONSTRUCTION OF EDGE-DISJOINT PATHS ON EXPANDER GRAPHS
    BRODER, AZ
    FRIEZE, AM
    UPFAL, E
    SIAM JOURNAL ON COMPUTING, 1994, 23 (05) : 976 - 989
  • [45] Approximation algorithms for edge-disjoint paths and unsplittable flow
    Department of Computer Science, University of Leicester, United Kingdom
    Lect. Notes Comput. Sci., 2006, (97-134):
  • [46] ON MAXIMAL SYSTEMS OF EDGE-DISJOINT INFINITE PATHS IN GRAPHS
    ANDREAE, T
    MATHEMATISCHE NACHRICHTEN, 1981, 101 : 219 - 228
  • [47] Approximation algorithms for edge-disjoint paths and unsplittable flow
    Erlebach, T
    EFFICIENT APPROXIMATION AND ONLINE ALGORITHMS: RECENT PROGRESS ON CLASSICAL COMBINATORIAL OPTIMIZATION PROBLEMS AND NEW APPLICATIONS, 2006, 3484 : 97 - 134
  • [48] The maximum edge-disjoint paths problem in bidirected trees
    Erlebach, T
    Jansen, K
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2001, 14 (03) : 326 - 355
  • [49] Logarithmic hardness of the undirected edge-disjoint paths problem
    Andrews, Matthew
    Zhang, Lisa
    JOURNAL OF THE ACM, 2006, 53 (05) : 745 - 761
  • [50] Hardness of the undirected edge-disjoint paths problem with congestion
    Andrews, M
    Chuzhoy, J
    Khanna, S
    Zhang, L
    46TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2005, : 226 - 241
12345