A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing.

Sven Peyer Dieter Rautenbach Jens Vygen A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing. 377-390 2009 7 J. Discrete Algorithms 4 http://dx.doi.org/10.1016/j.jda.2007.08.003 db/journals/jda/jda7.html#PeyerRV09