A randomized algorithm for finding a path subject to multiple QoS requirements

Turgay Korkmaz and Marwan M. Krunz
Computer Networks�–�Int. J. Computer & Telecommunications Networking 36(2–3):251–268, Jul 2001

Cites:

Finding the $k$ shortest paths

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