Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem

Open in new window