research
∙
05/31/2023
Fully Dynamic Submodular Maximization over Matroids
Maximizing monotone submodular functions under a matroid constraint is a...
share
research
∙
05/24/2023
Fairness in Streaming Submodular Maximization over a Matroid Constraint
Streaming submodular maximization is a natural model for the task of sel...
research
∙
08/16/2022
Deletion Robust Non-Monotone Submodular Maximization over Matroids
Maximizing a submodular function is a fundamental task in machine learni...
research
∙
04/11/2022
Submodular Maximization Subject to Matroid Intersection on the Fly
Despite a surge of interest in submodular maximization in the data strea...
research
∙
03/02/2022
Near-Optimal Correlation Clustering with Privacy
Correlation clustering is a central problem in unsupervised learning, wi...
research
∙
01/31/2022
Deletion Robust Submodular Maximization over Matroids
Maximizing a monotone submodular function is a fundamental task in machi...
research
∙
07/15/2021
Streaming Submodular Maximization with Matroid and Matching Constraints
Recent progress in (semi-)streaming algorithms for monotone submodular f...
research
∙
06/15/2021
Correlation Clustering in Constant Many Parallel Rounds
Correlation clustering is a central topic in unsupervised learning, with...
research
∙
06/09/2021
Streaming Belief Propagation for Community Detection
The community detection problem requires to cluster the nodes of a netwo...
research
∙
12/22/2020
Fast and Accurate k-means++ via Rejection Sampling
k-means++ <cit.> is a widely used clustering algorithm that is easy to i...
research
∙
11/13/2020
Consistent k-Clustering for General Metrics
Given a stream of points in a metric space, is it possible to maintain a...
research
∙
10/14/2020
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
Submodular maximization has become established as the method of choice f...
research
∙
06/08/2020
Fully Dynamic Algorithm for Constrained Submodular Optimization
The task of maximizing a monotone submodular function under a cardinalit...
research
∙
03/30/2020
The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness
We consider the classical problem of maximizing a monotone submodular fu...
research
∙
07/12/2019
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
Given a source of iid samples of edges of an input graph G with n vertic...
research
∙
08/06/2018
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams
Many tasks in machine learning and data mining, such as data diversifica...
research
∙
11/07/2017
