Hardness of Low Congestion Routing in Directed Graphs

We prove a strong inapproximability result for routing on directed graphs with low congestion. Given as input a directed graph on N vertices and a set of source-destination pairs that can be connected via edge-disjoint paths, we prove that it is hard, assuming NP doesn’t have

[1]  A. Wigderson,et al.  Disperser graphs, deterministic amplification, and imperfect random sources (גרפים מפזרים, הגברה דטרמיניסטית ומקורות אקראים חלשים.) , 1991 .

[2]  Lisa Zhang,et al.  Hardness of the undirected congestion minimization problem , 2005, STOC '05.

[3]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[4]  Lisa Zhang,et al.  Logarithmic hardness of the undirected edge-disjoint paths problem , 2006, JACM.

[5]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[6]  Joel Friedman,et al.  A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.

[7]  Aravind Srinivasan,et al.  Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[8]  Sanjeev Khanna,et al.  Hardness of Directed Routing with Congestion , 2006, Electron. Colloquium Comput. Complex..

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

[10]  Sanjeev Khanna,et al.  Edge disjoint paths revisited , 2003, SODA '03.

[11]  Subhash Khot,et al.  Query Efficient PCPs with Perfect Completeness , 2005, Theory Comput..

[12]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[13]  Sanjeev Khanna,et al.  Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion , 2005, FOCS.

[14]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[15]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 2003, J. Comput. Syst. Sci..

[16]  Devdatt P. Dubhashi,et al.  Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.

[17]  Lisa Zhang,et al.  Logarithmic hardness of the directed congestion minimization problem , 2006, STOC '06.

[18]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..