Hungarian Algorithm
The Hungarian Algorithm is a combinatorial optimization algorithm that solves assignment problems by finding a minimum-cost perfect matching in a bipartite graph, distinguishing itself through its polynomial-time efficiency and reliance on duality theory in linear programming.
378
Publications
37.4K
Citations
1.1K
Authors
466
Institutions
Publications per year
2017–2026
168
Variants
Kuhn-munkres Algorithm
Parents
378
The Hungarian method for the assignment problem
Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.6K citations
Simple online and realtime tracking
Alex Bewley, Zongyuan Ge, Lionel Ott et al. · 2016 · 3.9K citations · Full text
The Hungarian method for the assignment problem
H. W. Kuhn · Naval Research Logistics (NRL) · 2004 · 1.3K citations · Full text
3D Multi-Object Tracking: A Baseline and New Evaluation Metrics
Xinshuo Weng, Jianren Wang, David Held et al. · 2020 · 489 citations
1–5 of 378
1.1K
6
h-index
6
h-index
4
h-index
3
h-index
3
h-index
1–5 of 1.1K
466

Beijing University of Posts and Telecommunications
Beijing, China
13 h-index
52 publications
1.5K citations

Zhejiang University
Hangzhou, China
9 h-index
23 publications
888 citations
Tsinghua University
Beijing, China
9 h-index
23 publications
1K citations

Shanghai Jiao Tong University
Shanghai, China
7 h-index
15 publications
633 citations
University of Southern California
Los Angeles, United States
6 h-index
14 publications
615 citations

The University of Melbourne
Melbourne, Australia
6 h-index
15 publications
274 citations

National University of Defense Technology
Changsha, China
6 h-index
18 publications
805 citations
Carnegie Mellon University
Pittsburgh, United States
6 h-index
15 publications
3.4K citations
1–8 of 466
14 publications · 657 citations
14
h-index
13 publications · 399 citations
11
h-index
10 publications · 277 citations
10
h-index
Repository · 11 publications · 394 citations
10
h-index
6 publications · 166 citations
6
h-index
1–5