k-best enumeration
classification
💻 cs.DS
keywords
bestenumerationproblemsalgorithmsfindinggraphsincludingmatchings
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.