blob: a8b89bae6c02b7d24ffaeef4e03692ca5f566a68 (
plain) (
tree)
|
|
𝓞(n³) implementation of the Hungarian algorithm,
also known as the Hungarian method, Kuhn–Munkres
algorithm or Munkres assignment.
The Hungarian algorithm solved the minmum bipartite
match problem in 𝓞(n⁴). By implementing the priority
queue with a van Emde Boas tree the time can be
reduced to 𝓞(n³ log log n). The van Emde Boas tree
is possible to use because the elements values are
bounded within the priority queue's capacity.
However this implemention achived 𝓞(n³) by not using
a priority queue.
Edmonds and Karp, and independently Tomizawa, has
also reduced the time complexity to 𝓞(n³), but I
do not known how.
|
