%0 Conference Paper %1 conf/stacs/FederMOOP03 %A Feder, Tomás %A Motwani, Rajeev %A O'Callaghan, Liadan %A Olston, Chris %A Panigrahy, Rina %B STACS %D 2003 %E Alt, Helmut %E Habib, Michel %I Springer %K dblp %P 367-378 %T Computing Shortest Paths with Uncertainty. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2003.html#FederMOOP03 %V 2607 %@ 3-540-00623-0

@inproceedings{conf/stacs/FederMOOP03, added-at = {2020-01-02T00:00:00.000+0100}, author = {Feder, Tomás and Motwani, Rajeev and O'Callaghan, Liadan and Olston, Chris and Panigrahy, Rina}, biburl = {https://www.bibsonomy.org/bibtex/20985fe835357899ad918d7341f72a8d6/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2003}, editor = {Alt, Helmut and Habib, Michel}, ee = {https://doi.org/10.1007/3-540-36494-3_33}, interhash = {c01e46913a8a797ec0c22917cb6840c7}, intrahash = {0985fe835357899ad918d7341f72a8d6}, isbn = {3-540-00623-0}, keywords = {dblp}, pages = {367-378}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-09T20:44:31.000+0200}, title = {Computing Shortest Paths with Uncertainty.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2003.html#FederMOOP03}, volume = 2607, year = 2003 }