$K$ shortest paths and other “$K$ best” problems
David Eppstein
http://www.ics.uci.edu/~eppstein/bibs/kpath.bib
Cited by:
Semiring frameworks and algorithms for shortest-distance problems
An efficient algorithm for the $N$-best-strings problem
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
