Concepts2

Category

🔷All∑Math⚙️Algo🗂️DS📚Theory

Level

AllBeginnerIntermediateAdvanced
Filtering by:
#assignment problem
⚙️AlgorithmAdvanced

Hungarian Algorithm

The Hungarian algorithm solves the square assignment problem (matching n workers to n jobs) in O(n^{3}) time using a clever potential (label) function on vertices.

#hungarian algorithm#assignment problem#bipartite matching+11
⚙️AlgorithmAdvanced

Minimum Cost Maximum Flow

Minimum Cost Maximum Flow (MCMF) finds the maximum possible flow from a source to a sink while minimizing the total cost paid per unit of flow along edges.

#minimum cost maximum flow#successive shortest augmenting path#reduced cost+11