Stochastic shortest paths via quasi-convex maximization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4168 LNCS, Issue , 2006, Pages 552-563

  Nikolova, Evdokia ^a   Keiner, Jonathan A ^a   Brand, Matthew ^a   Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

EDGE LENGTH DISTRIBUTIONS; OPTIMIZATION SETTING; QUASI CONVEX MAXIMIZATION; THRESHOLD VALUE;

MOTION PLANNING;

EID: 33750711704     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_50     Document Type: Conference Paper

References (22)

1. H. Ackermann, A. Newman, H. Röglin, and B. Vöcking. Decision making based on approximate and smoothed pareto curves. In Proc. of 16th ISAAC, pages 675-684, 2005.
2. D. Bertsekas. Dynamic Programming and Optimal Control, volume II, 2nd Edition. Athena Scientific, Belmont, MA, 2001.
3. J. Boyan and M. Mitzenmacher. Improved results for route planning in stochastic transportation networks. In Proc. of Symposium of Discrete Algorithms, 2001.
4. P. Carstensen. The complexity of some problems in parametric linear and combinatorial programming. Ph.D. Thesis, Mathematics Dept., U. of Michigan, Ann Arbor, Mich., 1983.
5. B. Dean, M. Goemans, and J. Vondrak. Approximating the stochastic knapsack: the benefit of adaptivity. In Proceedings of FOCS, pages 208-217, 2004.
6. Y. Fan, R. Kalaba, and I. J. E. Moore. Arriving on time. Journal of Optimization Theory and Applications, forthcoming.
7. A. Goel and P. Indyk. Stochastic load balancing and related problems. In Proceedings of the 40th Symposium on Foundations of Computer Science, 1999.
8. R. Horst, P. M. Pardalos, and N. V. Thoai. Introduction to Global Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000.
9. D. Karger, R. Motwani, and G. D. S. Ramkumar. On approximating the longest path in a graph. Algorithmica, 18:82-98, 1997.
10. J. A. Kelner and D. A. Spielman. A randomized polynomial-time simplex algorithm for linear programming. Electronic Colloquium on Computational Complexity, No. 156, 2005.
11. J. Kleinberg, Y. Rabani, and É. Tardos. Allocating bandwidth for bursty connections. SIAM Journal on Computing, 30(1):191-217, 2000.
12. R. P. Loui. Optimal paths in graphs with stochastic or multidimentional weights. Communications of the ACM, 26:670-676, 1983.
13. E. D. Miller-Hooks and H. S. Mahmassani. Least expected time paths in stochastic, time-varying transportation networks. Transportation Science, 34:198-215, 2000.
14. P. Mirchandani and H. Soroush. Optimal paths in probabilistic networks: a case with temporary preferences. Computers and Operations Research, 12(4):365-381, 1985.
15. J. Mote, I. Murthy, and D. Olson. A parametric approach to solving bicriterion shortest path problems. European Journal of Operational Research, 53:81-92, 1991.
16. K. Mulmuley and P. Shah. A lower bound for the shortest path problem. Journal of Computer and System Sciences, 63(2):253-267, 2001.
17. E. Nikolova, M. Brand, and D. R. Karger. Optimal route planning under uncertainty. In Proceedings of International Conference on Automated Planning and Scheduling, 2006.
18. E. Nikolova and J. A. Kelner. On the hardness and smoothed complexity of low-rank quasi-concave minimization. Manuscript, May, 2006.
19. S. Pallottino and M. G. Scutella. Shortest path algorithms in transportation models: Classical and innovative aspects. Technical Report TR-97-06, Universita di Pisa Dipartimento di Informatica, Pisa, Italy, 1997.
20. C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map. Theoretical Computer Science, 84:127-150, 1991.
21. C. H. Papadimitriou and M. Yannakakis. On limited nondeterminism and the complexity of the V-C dimension. Journal of Computer and System Sciences, 53(2):161-170, 1996.
22. G. H. Polychronopoulos and J. N. Tsitsiklis. Stochastic shortest path problems with recourse. Networks, 27(2):133-143, 1996.