A. Gorgi

collaborators

2 papers

math.CO2021

Repeated randomized algorithm for the Multicovering Problem

Abbass Gorgi, Mourad El Ouali, Anand Srivastav +1

Let $H = (V, E)$ be a hypergraph with maximum edge size $ℓ$ and maximum degree $Δ$ . For given numbers $b_{v} \in N_{\geq 2}$ , $v \in V$ , a set multicover i…

math.CO2020

Approximation algorithm for the Multicovering Problem

Abbass Gorgi, Mourad El Ouali, Anand Srivastav +1

Let $H = (V, E)$ be a hypergraph with maximum edge size $ℓ$ and maximum degree $Δ$ . For given numbers $b_{v} \in N_{\geq 2}$ , $v \in V$ , a set multicover i…