Fast algorithms for k-submodular maximization subject to a matroid constraint. - Shuxian Niu; Qian Liu; Yang Zhou; Min Li (CoRR, 2023)

Fast algorithms combining threshold-decreasing and greedy methods for maximizing constraint k-submodular functions. - Shuxian Niu; Qian Liu 016; Yang Zhou 018; Min Li 028 (Discret. Math. Algorithms Appl., 2025)

Randomized approximation algorithms for monotone k-submodular function maximization with constraints. - Yuying Li; Min Li 028; Yang Zhou 018; Shuxian Niu; Qian Liu 016 (J. Comb. Optim., 2025)