On the N best problem for hypergraphs
Johanna Björklund, Frank Drewes, Anna Jönsson · 2016
We propose an algorithm for computing the $N$ best roots of a weighted hypergraph, in which the weight function is given over an idempotent and multiplicatively monotone semiring. We give a set of ...