Finding the k Shortest Paths (1997)

by David Eppstein
Citations:311 - 2 self

Active Bibliography

832 An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision – Yuri Boykov, Vladimir Kolmogorov - 2001
790 An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions – Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu - 1994
729 Introduction to Algorithms (Second Edition – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
513 How bad is selfish routing? – Tim Roughgarden, Éva Tardos - 2002
1656 Nonlinear dimensionality reduction by locally linear embedding – Sam T. Roweis, Lawrence K. Saul - 2000
641 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
535 Program Analysis and Specialization for the C Programming Language – Lars Ole Andersen - 1994
524 A new approach to the maximum flow problem – Andrew V. Goldberg, Robert E. Tarjan - 1988
987 A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks – Elizabeth M. Royer, Chai-Keong Toh