Preprint
Oct 2026
k-Submodular Cover Problem with a Matroid Constraint
A matroid extended greedy algorithm is proposed for the k-submodular cover problem, its bi-criteria approximation ratio is analyzed, and an improved approximation ratio under the special case of unit costs is derived.
Xin-Rui Li, Dong-Lei Du, Qian Liu et al.
· 0 citations