k-best enumeration
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 16 Dec 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.