Before revision:  In this paper , we consider the problem with additionalfairness constraints , which takes into account the group membership of data items and limits the  number of items selected from each group to a given number. We propose efficient algorithms for this fairness-aware variant of the streaming submodular maximization problem.
After revision:  In this paper , we consider the problem with additionalfairness constraints , which takes into account the group membership of data items and limits the number of items selected from each group . We then propose efficient algorithms for this fairness-aware variant of the streaming submodular maximization problem.