English

$k$-best enumeration

Data Structures and Algorithms 2014-12-17 v1

Abstract

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

Keywords

Cite

@article{arxiv.1412.5075,
  title  = {$k$-best enumeration},
  author = {David Eppstein},
  journal= {arXiv preprint arXiv:1412.5075},
  year   = {2014}
}

Comments

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

R2 v1 2026-06-22T07:33:41.313Z