Stochastic Shortest Paths Via Quasi-convex Maximization

We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path length does not exceed a given threshold value (deadline). We give a surprising exact nΘ (log n) algorithm for the case of normally distributed edge lengths, which is based on quasi-convex maximization. We then prove average and smoothed polynomial bounds for this algorithm, which also translate to average and smoothed bounds for the parametric shortest path problem, and extend to a more general non-convex optimization setting. We also consider a number other edge length distributions, giving a range of exact and approximation schemes.

[1]  Ronald Prescott Loui,et al.  Optimal paths in graphs with stochastic or multidimensional weights , 1983, Commun. ACM.

[2]  Patricia J. Carstensen.  The complexity of some problems in parametric linear and combinatorial programming , 1983 .

[3]  Hossein Soroush,et al.  Optimal paths in probabilistic networks: A case with temporary preferences , 1985, Comput. Oper. Res..

[4]  I. Murthy,et al.  A parametric approach to solving bicriterion shortest path problems , 1991 .

[5]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[6]  Mihalis Yannakakis,et al.  On limited nondeterminism and the complexity of the V-C dimension , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[7]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[8]  John N. Tsitsiklis,et al.  Stochastic shortest path problems with recourse , 1996, Networks.

[9]  Yuval Rabani,et al.  Allocating bandwidth for bursty connections , 1997, STOC '97.

[10]  S. Pallottino,et al.  Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .

[11]  Ashish Goel,et al.  Stochastic load balancing and related problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[12]  Hani S. Mahmassani,et al.  Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks , 1999, Transp. Sci..

[13]  Ketan Mulmuley,et al.  A lower bound for the shortest path problem , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[14]  Michael Mitzenmacher,et al.  Improved results for route planning in stochastic transportation , 2000, SODA '01.

[15]  Reiner Horst,et al.  Introduction to Global Optimization (Nonconvex Optimization and Its Applications) , 2002 .

[16]  Jan Vondrák,et al.  Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[17]  R. Kalaba,et al.  Arriving on Time , 2005 .

[18]  David R. Karger,et al.  Optimal Route Planning under Uncertainty , 2006, ICAPS.

[19]  Daniel A. Spielman,et al.  A randomized polynomial-time simplex algorithm for linear programming , 2006, STOC '06.

[20]  David R. Karger,et al.  On approximating the longest path in a graph , 1997, Algorithmica.

[21]  Leo Liberti,et al.  Introduction to Global Optimization , 2006 .

[22]  Berthold Vöcking,et al.  Decision-making based on approximate and smoothed Pareto curves , 2007, Theor. Comput. Sci..