G. Gutin

collaborators

2 papers

cs.DS2024

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs

Chen Wang, Chao Wang, Gregory Z. Gutin +1

Let $G = (V, E)$ be a graph and let each vertex of $G$ has a lamp and a button. Each button can be of $σ^{+}$ -type or $σ$ -type. Assume that initially some lamps are on and others are o…

cs.DS2023

Streaming Algorithms for the $k$ -Submodular Cover Problem

Wenqi Wang, Gregory Gutin, Yaping Mao +2

Given a natural number $k \geq 2$ , we consider the $k$ -submodular cover problem ( $k$ -SC). The objective is to find a minimum cost subset of a ground set $X$ subject to the…

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs

Streaming Algorithms for the k-Submodular Cover Problem

Streaming Algorithms for the $k$ -Submodular Cover Problem