Hungarian algorithm

Known as: KM algorithm, Kuhn-Munkres algorithm, Munkres' assignment algorithm 
The Hungarian method is a combinatorial optimization algorithm that solves the assignment problem in polynomial time and which anticipated later… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The structural similarity between two process models is usually considered as the main measurement for ranking the process models… (More)
  • figure 3
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2016
2016
Visible light communication (VLC) combined with advanced illumination may be expected to become an integral part of next… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2011
2011
Coordinated spectrum sensing ensures Cognitive Radio systems to get the usability of every channel within the entire spectrum of… (More)
  • figure 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper has always been one of my favorite “children,” combining as it does elements of the duality of linear programming and… (More)
  • figure 1
  • figure 2
Is this relevant?
2010
2010
Consider a set-classification task where c objects must be labelled simultaneously in c classes, knowing that there is only one… (More)
  • figure 2
  • figure 3
  • table 1
  • figure 4
  • figure 5
Is this relevant?
2010
2010
An optimal resource allocation algorithm, Hungarian algorithm, is not directly applicable to manufacturing scheduling problems… (More)
  • table I
  • figure 1
  • table II
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We present a detection-based three-level hierarchical association approach to robustly track multiple objects in crowded… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2008
2008
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In this paper, we present the dynamic Hungarian algorithm, applicable to optimally solving the assignment problem in situations… (More)
  • figure 1
  • figure 2
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1981
Highly Cited
1981
We propose a new algorithm for the classical assignment problem. The algorithm resembles in some ways the Hungarian method but… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?