A. Srivastav

activity

20172021

most citedFinding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

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…

math.CO2018

A new Bound for the Maker-Breaker Triangle Game

Christian Glazik, Anand Srivastav

The triangle game introduced by Chvátal and Erdős (1978) is one of the most famous combinatorial games. For $n, q \in N$ , the $(n, q)$ -triangle game is played by two players,…