research
∙
05/31/2023
Fully Dynamic Submodular Maximization over Matroids
Maximizing monotone submodular functions under a matroid constraint is a...
share
research
∙
08/16/2022
Deletion Robust Non-Monotone Submodular Maximization over Matroids
Maximizing a submodular function is a fundamental task in machine learni...
research
∙
01/31/2022
Deletion Robust Submodular Maximization over Matroids
Maximizing a monotone submodular function is a fundamental task in machi...
research
∙
06/10/2020
Sliding Window Algorithms for k-Clustering Problems
The sliding window model of computation captures scenarios in which data...
research
∙
06/08/2020
Fully Dynamic Algorithm for Constrained Submodular Optimization
The task of maximizing a monotone submodular function under a cardinalit...
research
∙
05/05/2020
Edge-Weighted Online Bipartite Matching
Online bipartite matching and its variants are among the most fundamenta...
research
∙
05/02/2019
Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
Streaming algorithms are generally judged by the quality of their soluti...
research
∙
08/19/2018
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity Complexity
As a generalization of many classic problems in combinatorial optimizati...
research
∙
07/20/2018
Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity
As a generalization of many classic problems in combinatorial optimizati...
research
∙
06/07/2018
Data Summarization at Scale: A Two-Stage Submodular Approach
The sheer scale of modern datasets has resulted in a dire need for summa...
research
∙
12/14/2017
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order
In the Submodular Welfare Maximization (SWM) problem, the input consists...
research
∙
11/20/2017
Deletion-Robust Submodular Maximization at Scale
Can we efficiently extract useful information from a large user-generate...
research
∙
05/31/2016
