$k$-best enumeration

Abstract

We survey $k$-best enumeration problems and the algorithms for solving them, including in particular the problems of finding the $k$ shortest paths, $k$ smallest spanning trees, and $k$ best matchings in weighted graphs.

17 pages. A significantly shorter version of this material appears in the Springer Encyclopedia of Algorithms, 2014