@article{Zhang2024, 
author = {Zhenning Zhang and Kaiqiao Meng and Donglei Du and Yang Zhou},
title = {Maximizing Submodular+Supermodular Functions Subject to a Fairness Constraint},
year = {2024},
journal = {Tsinghua Science and Technology},
volume = {29},
number = {1},
pages = {46-55},
keywords = {submodular function, greedy algorithm, streaming algorithm, supermodular function, fairness constraint, threshold greedy algorithm},
url = {https://www.sciopen.com/article/10.26599/TST.2022.9010013},
doi = {10.26599/TST.2022.9010013},
abstract = {We investigate the problem of maximizing the sum of submodular and supermodular functions under a fairness constraint. This sum function is non-submodular in general. For an offline model, we introduce two approximation algorithms: A greedy algorithm and a threshold greedy algorithm. For a streaming model, we propose a one-pass streaming algorithm. We also analyze the approximation ratios of these algorithms, which all depend on the total curvature of the supermodular function. The total curvature is computable in polynomial time and widely utilized in the literature.}
}