On August 24, 2021, Eun Jung Kim (김은정) from LAMSADE, CNRS gave a talk at the Discrete Math Seminar on an approximation algorithm for finding the minimum weight vertex set hitting all bonds of size at least k in a graph. The title of her talk was “A Constant-factor Approximation for Weighted Bond Cover“.