Dealing with additional constraints in the $k$-shortest path problem

Tuomo Takkula, Ralf Bornd�rfer, and Andreas M. L�bel
Proc. Chalmers Winter Meeting, 2000
http://www.cs.chalmers.se/~ilya/WM2000/proceedings.html

Cites:

Finding the $k$ shortest paths

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine