Streaming Algorithms for the $k$-Submodular Cover Problem

Wenqi Wang, Gregory Gutin, Yaping Mao +2

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