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

Authors

1.1K

  1. KK
    Kris Kitani

    Carnegie Mellon University, United States

    6 publications · 904 citations

    6

    h-index

  2. XW
    Xinshuo Weng

    Carnegie Mellon University, United States

    6 publications · 904 citations

    6

    h-index

  3. VK
    Vijay Kumar

    University of Pennsylvania, United States

    4 publications · 178 citations

    4

    h-index

  4. YB
    Yutong Ban

    Massachusetts Institute of Technology, United States

    3 publications · 275 citations

    3

    h-index

  5. DH
    David Held

    Carnegie Mellon University, United States

    3 publications · 572 citations

    3

    h-index

1–5 of 1.1K

Venues

  1. IEEE Access

    14 publications · 657 citations

    14

    h-index

  2. IEEE Transactions on Vehicular Technology

    13 publications · 399 citations

    11

    h-index

  3. Sensors

    10 publications · 277 citations

    10

    h-index

  4. arXiv (Cornell University)

    Repository · 11 publications · 394 citations

    10

    h-index

  5. IEEE Communications Letters

    6 publications · 166 citations

    6

    h-index

1–5