Stochastic shortest paths via Quasi-convex maximization

Authors:
Evdokia Nikolova;Jonathan A. Kelner;Matthew Brand;Michael Mitzenmacher
Affiliations:
MIT CSAIL, MERL, Harvard University / Cambridge MA;MIT CSAIL, MERL, Harvard University / Cambridge MA;MIT CSAIL, MERL, Harvard University / Cambridge MA;MIT CSAIL, MERL, Harvard University / Cambridge MA
Venue:
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Year:
2006

Citing 13
Cited 16

Shortest paths without a map

Theoretical Computer Science
On limited nondeterminism and the complexity of the V-C dimension

Journal of Computer and System Sciences
Optimal paths in graphs with stochastic or multidimensional weights

Communications of the ACM
Improved results for route planning in stochastic transportation

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Programming and Optimal Control

Dynamic Programming and Optimal Control
Allocating Bandwidth for Bursty Connections

SIAM Journal on Computing
Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks

Transportation Science
Stochastic Load Balancing and Related Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Shortest Path Algorithms in Transportation models: classical and innovative aspects

Shortest Path Algorithms in Transportation models: classical and innovative aspects
The complexity of some problems in parametric linear and combinatorial programming

The complexity of some problems in parametric linear and combinatorial programming
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Decision making based on approximate and smoothed pareto curves

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Stochastic shortest path with unlimited hops

Information Processing Letters
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Approximating Matches Made in Heaven

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Probabilistic path queries in road networks: traffic uncertainty aware path selection

Proceedings of the 13th International Conference on Extending Database Technology
Approximation algorithms for reliable stochastic combinatorial optimization

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Sequential Grid Computing: Models and Computational Experiments

INFORMS Journal on Computing
Stochastic motion planning and applications to traffic

International Journal of Robotics Research
Stochastic selfish routing

SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Possibilistic bottleneck combinatorial optimization problems with ill-known weights

International Journal of Approximate Reasoning
On the complexity of time-dependent shortest paths

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
High-Performance heuristics for optimization in stochastic traffic engineering problems

LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
Stochastic matching with commitment

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Sequential Grid Computing: Models and Computational Experiments

INFORMS Journal on Computing
Polynomial-Time approximation schemes for shortest path with alternatives

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Risk sensitivity of price of anarchy under uncertainty

Proceedings of the fourteenth ACM conference on Electronic commerce
Stochastic combinatorial optimization via poisson approximation

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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θ(logn) 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.