Professor, KTH Royal Institute of Technology, Stockholm, Sweden
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 present a novel problem that allows to infer a small and interpretable set of prevalent opinion ranges in signed graphs, that explain the users' interactions.