Minimizing the union: tight approximations for small set bipartite vertex expansion
SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, pp. 881-899, 2017.
In the Minimum k-Union problem (MkU) we are given a set system with n sets and are asked to select k sets in order to minimize the size of their union. Despite being a very natural problem, it has received surprisingly little attention: the only known approximation algorithm is an [EQUATION]-approximation due to [Chlamtáč et al APPROX '16...More
Full Text (Upload PDF)
PPT (Upload PPT)