Repeated randomized algorithm for the Multicovering Problem

Abbass Gorgi, Mourad El Ouali, Anand Srivastav +1

Let $\mathcal{H}=(V,\mathcal{E})$ be a hypergraph with maximum edge size $\ell$ and maximum degree $\Delta$. For given numbers $b_v\in {\mathbb{N}}_{\ge 2}$, $v\in V$, a set multicover i…