Eunjin Oh (오은진) gave a talk on an almost linear-time approximation algorithm for the minimum-weight b-edge cover on geometric complete bipartite graphs at the Discrete Math Seminar

On April 29, 2025, Eunjin Oh (오은진) from POSTECH gave a talk at the Discrete Math Seminar on an almost linear-time approximation algorithm for the minimum-weight b-edge cover on geometric complete bipartite graphs. The title of her talk was “Approximation Algorithms for the Geometric Multimatching Problem“.