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:

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