Fairness k-Submodular Maximization Subject to Matroid Constraint
Comprehensive experiments on standard benchmark datasets demonstrate that the introduced constant-factor approximation algorithm achieves competitive objective values while maintaining a favorable balance between fairness guarantees and query complexity efficiency compared to existing state-of-the-art methods.