Background Bipartite graph matching 3 Solved by the Hungarian method 4 in polynomial time 6 Harold w, Kuhn Traditional applications Assignment problem, vehicle scheduling problem, etc. Perform well in offline scenarios⚫ Bipartite graph matching ⚫ Traditional applications ⚫ Assignment problem, vehicle scheduling problem, etc. ⚫ Perform well in offline scenarios Background 4 3 1 2 4 5 6 2 3 4 1 2 Solved by the Hungarian method in polynomial time Harold W. Kuhn