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

Hue T. Nguyen, Tan D. Tran, Nguyen Long Giang +1

We study the $k$-Submodular Cover ($kSC$) problem, a natural generalization of the classical Submodular Cover problem that arises in artificial intelligence and combinatorial optim…