Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem

Jacek Czekaj,Lesław Socha

doi:10.1007/978-3-642-04802-9_11

Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem

Jacek Czekaj, Lesław Socha

Open Access

https://doi.org/10.1007/978-3-642-04802-9_11

Copy DOI

Publication Date: Jan 1, 2009

Citations: 14

Affiliation: University of Silesia, Institute of Physics, Cardinal Stefan Wyszyński University in Warsaw

#Exact Algorithms #Approximate Algorithms + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

The Random Shortest Path Problem with the second moment criterion is discussed in this paper. After the formulation of the problem, exact algorithms, based on general concepts for solving the Multi-objective Shortest Path Problem, are described. Next, several approximate algorithms are proposed. It is shown that the complexity of the exact algorithms is exponential, while the complexity of the approximate algorithms is only polynomial. Computational results for the exact and approximate algorithms, which were performed on large graphs, are shown.

Full Text