activity
20102023
most citedBeyond -Approximation for Submodular Maximization on Massive Data Streams

42 citations · 204 across the 38 of their papers we have counts for

collaborators
Showing 2020Show all

7 papers · 1 filter

cs.LG2020★ 5 cited

Fast and Accurate -means++ via Rejection Sampling

Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard +2

-means++ \cite{arthur2007k} is a widely used clustering algorithm that is easy to implement, has nice theoretical guarantees and strong empirical performance. Despite its wide a…

cs.DS2020

Consistent k-Clustering for General Metrics

Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard +1

Given a stream of points in a metric space, is it possible to maintain a constant approximate clustering by changing the cluster centers only a small number of times during the ent…

cs.LG2020★ 22 cited

The Primal-Dual method for Learning Augmented Algorithms

Étienne Bamas, Andreas Maggiori, Ola Svensson

The extension of classical online algorithms when provided with predictions is a new and active research area. In this paper, we extend the primal-dual method for online algorithms…

cs.LG2020★ 14 cited

Learning Augmented Energy Minimization via Speed Scaling

Étienne Bamas, Andreas Maggiori, Lars Rohwedder +1

As power management has become a primary concern in modern data centers, computing resources are being scaled dynamically to minimize energy consumption. We initiate the study of a…

cs.DS2020★ 11 cited

Fair Colorful k-Center Clustering

Xinrui Jia, Kshiteej Sheth, Ola Svensson

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is t…

cs.DS2020

Robust Algorithms under Adversarial Injections

Paritosh Garg, Sagar Kale, Lars Rohwedder +1

In this paper, we study streaming and online algorithms in the context of randomness in the input. For several problems, a random order of the input sequence---as opposed to the wo…

cs.DS2020★ 1 cited

The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson +1

We consider the classical problem of maximizing a monotone submodular function subject to a cardinality constraint, which, due to its numerous applications, has recently been studi…