An algorithm for $k$-set cover

Abstract

We show that set cover on a universe of size $n$ and with sets of size at most $k$ can be solved in time $2^{(1-1/k+O(1/k^{3/2}))n}$. This improves on a $2^{(1-0.929/k)n}$-time algorithm of Bj\"orklund (STACS 2010) for all sufficiently large $k$.