Finding Disjoint Paths in Expanders Deterministically and Online

We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorithm is a sufficiently strong d-regular expander G on n vertices, and a sequence of pairs si, ti (1lesilesr) of vertices, where, r=Theta(nd log d/log n), and no vertex appears more than d/3 times in the list of all endpoints s1, t1,... ,sr,tr. The algorithm outputs edge-disjoint paths Q1,...,Qr, where Qi connects si and ti. The paths are constructed online, that is, the algorithm produces Qi as soon as it gets si, ti and before the next requests in the sequence are revealed. This improves in several respects a long list of previous algorithms for the above problem, whose study is motivated by the investigation of communication networks. An analogous result is established for vertex disjoint paths in blowups of strong expanders.

[1]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[2]  Avi Wigderson,et al.  Deterministic simulation of probabilistic constant depth circuits , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[3]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[4]  N. Alon.  Eigenvalues and expanders , 1986, Comb..

[5]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[6]  Noam Nisan,et al.  Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

[8]  Noam Nisan,et al.  Approximate Inclusion-Exclusion , 1990, Comb..

[9]  Bruce M. Maggs,et al.  On-line algorithms for path selection in a nonblocking network , 1990, STOC '90.

[10]  Daniel A. Spielman,et al.  The perceptron strikes back , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[11]  Noam Nisan,et al.  Pseudorandom bits for constant depth circuits , 1991, Comb..

[12]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

[13]  Noga Alon,et al.  Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

[15]  Moni Naor,et al.  Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..

[16]  Avi Wigderson,et al.  Deterministic approximate counting of depth-2 circuits , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[17]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1993, JACM.

[18]  James Aspnes,et al.  The expressive power of voting polynomials , 1994, Comb..

[19]  Noga Alon,et al.  Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling , 1994, Theor. Comput. Sci..

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

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

[22]  D. West.  Introduction to Graph Theory , 1995 .

[23]  Bruce M. Maggs,et al.  On-Line Algorithms for Path Selection in a Nonblocking Network , 1996, SIAM J. Comput..

[24]  Ronitt Rubinfeld,et al.  Short paths in expander graphs , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[25]  Avi Wigderson,et al.  P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.

[26]  Aravind Srinivasan,et al.  Multicommodity flow and circuit switching , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[27]  Alan M. Frieze.  Disjoint Paths in Expander Graphs via Random Walks: A Short Survey , 1998, RANDOM.

[28]  Eli Upfal,et al.  Static and dynamic path selection on expander graphs: a random walk approach , 1999 .

[29]  Aravind Srinivasan,et al.  New algorithmic aspects of the Local Lemma with applications to routing and partitioning , 1999, SODA '99.

[30]  Alan M. Frieze,et al.  Optimal construction of edge-disjoint paths in random regular graphs , 2000, SODA '99.

[31]  Alan M. Frieze.  Edge-disjoint paths in expander graphs , 2000, SODA '00.

[32]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

[33]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 2005, computational complexity.

[34]  Michael Luby,et al.  On deterministic approximation of DNF , 2005, Algorithmica.