Sliding Window Algorithms for k-Clustering Problems

NeurIPS 2020 Michele Borassi Alessandro Epasto Silvio Lattanzi Sergei Vassilvitskii Morteza Zadimoghaddam

The sliding window model of computation captures scenarios in which data is arriving continuously, but only the latest $w$ elements should be used for analysis. The goal is to design algorithms that update the solution efficiently with each arrival rather than recomputing it from scratch... (read more)

PDF Abstract NeurIPS 2020 PDF NeurIPS 2020 Abstract

Categories


  • DATA STRUCTURES AND ALGORITHMS