Shortest Paths Algorithms: Theory and Experimental Evaluation

by: Boris V Cherkassky, Andrew V Goldberg, Tomasz Radzik

(1994)

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

mplomer, pkordy, yildizca, jmarcelino

Find related articles with these CiteULike tags

algorithms, cherkassky, experimental, goldberg, network, shortest_paths, sp, theory

Abstract

. We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of...

@inproceedings{citeulike:469894, abstract = {. We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of...}, author = {Cherkassky, Boris V. and Goldberg, Andrew V. and Radzik, Tomasz }, booktitle = {SODA: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)}, citeulike-article-id = {469894}, keywords = {algorithms, network}, posted-at = {2007-11-05 16:12:25}, priority = {3}, title = {Shortest Paths Algorithms: Theory and Experimental Evaluation}, url = {http://citeseer.ist.psu.edu/cherkassky93shortest.html}, year = {1994} }

RIS record

TY - CONF ID - citeulike:469894 L3 - citeulike-article-id:469894 TI - Shortest Paths Algorithms: Theory and Experimental Evaluation T2 - SODA: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms) N2 - . We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of... KW - algorithms KW - network AU - Cherkassky, Boris AU - Goldberg, Andrew AU - Radzik, Tomasz PY - 1994/// UR - http://citeseer.ist.psu.edu/cherkassky93shortest.html ER -

RIS BibTeX