Computing the $K$ shortest paths: A new algorithm and an experimental comparison

Víctor Manuel Jiménez Pelayo and Andrés Marzal Varó
Proc. 3rd Int. Worksh. Algorithm Engineering (WAE 1999), Lecture Notes in Computer Science 1668, Jeffrey Scott Vitter and Christos D. Zaroliagis, ed., Springer-Verlag, 1999, pp. 15–29
http://terra.act.uji.es/REA/papers/wae99.ps.gz

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!