Assistant Professor, University of Liverpool
2 papers at NeurIPS 2025
This paper proposes an approximation algorithm for streaming stochastic submodular maximization problem under a novel on-demand user requests senario
We introduce the Fair Minimum Labeling problem for designing temporally efficient and fair activation plans, prove tight hardness bounds, and present approximation algorithms with strong empirical results on fair multi-source learning.
