online matching I | deterministic
Professor Tang’s online seminar course today covers online matching. (very short) motivation The (offline) maximum matching problem is a well-studied area in graph theory, even though some cases (e.g., on general graphs with weights) can be NP-hard. Classic algorithms have provided efficient solutions for specific cases: Bipartite matching: Solved using the Ford-Fulkerson Algorithm for maximum flow. Weighted bipartite matching: Uses the Hungarian Algorithm to find an optimal match. Unweighted general graphs: Solved by Edmonds’ Blossom Algorithm, which extends matching theory to handle odd-length cycles....