Computing shortest paths with uncertainty

Journal of Algorithms

Volumn 62, Issue 1, 2007, Pages 1-18

  Feder, Tomás ^a   Motwani, Rajeev ^a   O'Callaghan, Liadan ^a   Olston, Chris ^a   Panigrahy, Rina ^b  

^a Stanford University   (United States)

^b CISCO SYSTEMS   (United States)

Author keywords

Shortest path

Indexed keywords

COSTS; PROBLEM SOLVING; UNCERTAINTY ANALYSIS;

SHORTEST PATH;

COMPUTATIONAL METHODS;

EID: 34047126506     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.07.005     Document Type: Article

References (11)

1. Aingworth D., Chekuri C., Indyk P., and Motwani R. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28 (1999) 1167-1181
2. P. Berman, M. Karpinski, On some tighter inapproximability results, DIMACS Technical Report 99-23, 1999
3. X. Deng, T. Kameda, C. Papadimitriou, How to learn an unknown environment, J. ACM, in press
4. Feder T., Motwani R., Panigrahy R., Olston C., and Widom J. Computing the median with uncertainty. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (2000) 602-607
5. Füredi Z. Matchings and covers in hypergraphs. Graphs Combin. 4 (1988) 115-206
6. O. Karasan, M. Pinar, H. Yaman, The robust shortest path problem with interval data, Manuscript, August 2001
7. Khanna S., and Tan W. On computing function with uncertainty. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2001) 171-182
8. Lovász L. On minimax theorems of combinatorics. Doctoral Thesis (Hungarian). Mathematikai Lapok 26 (1975) 209-264
9. R. Montemanni L.M. Gambardella, An algorithm for the relative robust shortest path problem with interval data, Technical Report IDSIA-05-02, 2002
10. Olston C., and Widom J. Offering a precision-performance tradeoff for aggregation queries over replicated data. Proceedings of the 26th International Conference on Very Large Data Bases (2000) 144-155
11. Papadimitriou C.H., and Yannakakis M. Shortest paths without a map. Proceedings of the 16th International Colloquium on Automata, Languages, and Programming. Lecture Notes in Comput. Sci. vol. 372 (1989) 610-620