arXiv Open Access 2014

$k$-best enumeration

David Eppstein

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DS

Penulis (1)

David Eppstein

Format Sitasi

APA MLA BibTeX

Eppstein, D. (2014). $k$-best enumeration. https://arxiv.org/abs/1412.5075

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2014
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓