Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion

The problem of routing in graphs using node-disjoint paths has received a lot of attention and a polylogarithmic approximation algorithm with constant congestion is known for undirected graphs [Chuzhoy and Li 2016] and [Chekuri and Ene 2013]. However, the problem is hard to approximate within polynomial factors on directed graphs, for any constant congestion [Chuzhoy, Kim and Li 2016]. Recently, [Chekuri, Ene and Pilipczuk 2016] have obtained a polylogarithmic approximation with constant congestion on directed planar graphs, for the special case of symmetric demands. We extend their result by obtaining a polylogarithmic approximation with constant congestion on arbitrary directed minor-free graphs, for the case of symmetric demands.

[1]  Yuval Rabani,et al.  On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[2]  Clifford Stein,et al.  Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs ( Extended Abstract ) , 1998 .

[3]  Sanjeev Khanna,et al.  An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow , 2006, Theory Comput..

[4]  Venkatesan Guruswami,et al.  Hardness of routing with congestion in directed graphs , 2007, STOC '07.

[5]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

[6]  Alan M. Frieze,et al.  Existence and Construction of Edge-Disjoint Paths on Expander Graphs , 1994, SIAM J. Comput..

[7]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[8]  Alok Aggarwal,et al.  Efficient routing and scheduling algorithms for optical networks , 1994, SODA '94.

[9]  Julia Chuzhoy,et al.  On Approximating Node-Disjoint Paths in Grids , 2015, APPROX-RANDOM.

[10]  Sanjeev Khanna,et al.  Multicommodity flow, well-linked terminals, and routing problems , 2005, STOC '05.

[11]  Shi Li,et al.  Improved approximation for node-disjoint paths in planar graphs , 2016, STOC.

[12]  Marcin Pilipczuk,et al.  Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs , 2016, ICALP.

[13]  Ken-ichi Kawarabayashi,et al.  Polylogarithmic Approximation for Minimum Planarization (Almost) , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[14]  Erik D. Demaine,et al.  Approximation algorithms for classes of graphs excluding single-crossing graphs as minors , 2004, J. Comput. Syst. Sci..

[15]  Carsten Thomassen.  A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces , 1997, J. Comb. Theory, Ser. B.

[16]  Erik D. Demaine,et al.  Linearity of grid minors in treewidth with applications through bidimensionality , 2008, Comb..

[17]  Anastasios Sidiropoulos,et al.  Approximation Algorithms for Euler Genus and Related Problems , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[18]  Paul D. Seymour,et al.  Graph Minors. XVI. Excluding a non-planar graph , 2003, J. Comb. Theory, Ser. B.

[19]  Bruce A. Reed,et al.  Introducing Directed Tree Width , 1999, Electron. Notes Discret. Math..

[20]  Eli Upfal,et al.  Constructing disjoint paths on expander graphs , 1987, Comb..

[21]  Robin Thomas,et al.  Directed Tree-Width , 2001, J. Comb. Theory, Ser. B.

[22]  Julia Chuzhoy,et al.  New hardness results for routing on disjoint paths , 2016, STOC.

[23]  Chandra Chekuri,et al.  The all-or-nothing flow problem in directed graphs with symmetric demand pairs , 2015, Math. Program..

[24]  ChuzhoyJulia,et al.  A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 , 2016 .

[25]  Chandra Chekuri,et al.  Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion , 2013, SODA.

[26]  Sanjeev Khanna,et al.  The all-or-nothing multicommodity flow problem , 2004, STOC '04.