Search Results for author:
Found 4 papers, 2 papers with code
Fast Distributed k-Means with a Small Number of Rounds
Our algorithm guarantees a cost approximation factor and a number of communication rounds that depend only on the computational capacity of the coordinator.
A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering
We give the first algorithm for this setting that obtains a constant approximation factor on the optimal risk under a random arrival order, an exponential improvement over previous work.
Sequential no-Substitution k-Median-Clustering
We provide an efficient algorithm for this setting, and show that its multiplicative approximation factor is twice the approximation factor of an efficient offline algorithm.
Interactive algorithms: from pool to stream
We consider interactive algorithms in the pool-based setting, and in the stream-based setting.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
