%0 Conference Paper %1 conf/tapas/MeyerNW11 %A Meyer, Ulrich %A Negoescu, Andrei %A Weichert, Volker %B TAPAS %D 2011 %E Marchetti-Spaccamela, Alberto %E Segal, Michael %I Springer %K %P 217-228 %T New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches. %U http://dblp.uni-trier.de/db/conf/tapas/tapas2011.html#MeyerNW11 %V 6595 %@ 978-3-642-19753-6

@inproceedings{conf/tapas/MeyerNW11, added-at = {2023-12-13T01:20:29.000+0100}, author = {Meyer, Ulrich and Negoescu, Andrei and Weichert, Volker}, biburl = {https://www.bibsonomy.org/bibtex/2c2b30c437de1de162f2e56201a19d047/admin}, booktitle = {TAPAS}, crossref = {conf/tapas/2011}, editor = {Marchetti-Spaccamela, Alberto and Segal, Michael}, ee = {https://doi.org/10.1007/978-3-642-19754-3_22}, interhash = {702cb2437662c19b8ecaeb998d509d94}, intrahash = {c2b30c437de1de162f2e56201a19d047}, isbn = {978-3-642-19753-6}, keywords = {}, pages = {217-228}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2023-12-13T01:20:29.000+0100}, title = {New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches.}, url = {http://dblp.uni-trier.de/db/conf/tapas/tapas2011.html#MeyerNW11}, volume = 6595, year = 2011 }