85 citations · 225 across the 16 of their papers we have counts for
5 papers · 1 filter
Max-Min Diversification with Fairness Constraints: Exact and Approximation Algorithms
Yanhao Wang, Michael Mathioudakis, Jia Li +1
Diversity maximization aims to select a diverse and representative subset of items from a large dataset. It is a fundamental optimization task that finds applications in data summa…
Balancing Utility and Fairness in Submodular Maximization (Technical Report)
Yanhao Wang, Yuchen Li, Francesco Bonchi +1
Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications -- including data summarization, influence maximization, and recomm…
Streaming Algorithms for Diversity Maximization with Fairness Constraints
Yanhao Wang, Francesco Fabbri, Michael Mathioudakis
Diversity maximization is a fundamental problem with wide applications in data summarization, web search, and recommender systems. Given a set of elements, it asks to selec…
Coresets for Minimum Enclosing Balls over Sliding Windows
Yanhao Wang, Yuchen Li, Kian-Lee Tan
\emph{Coresets} are important tools to generate concise summaries of massive datasets for approximate analysis. A coreset is a small subset of points extracted from the original po…
Efficient Representative Subset Selection over Sliding Windows
Yanhao Wang, Yuchen Li, Kian-Lee Tan
Representative subset selection (RSS) is an important tool for users to draw insights from massive datasets. Existing literature models RSS as the submodular maximization problem t…