Clustering Problems on Sliding Windows

DOI10.1137/1.9781611974331.ch95zbMath1411.68182OpenAlexW4242365185MaRDI QIDQ4575678

Harry Lang, Vladimir Braverman, Keith Levin, Morteza Monemizadeh

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch95

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Approximation algorithms (68W25)

Related Items (5)

Approximation algorithms for two variants of correlation clustering problem ⋮ Symmetric norm estimation and regression on sliding windows ⋮ Improved Algorithms for Time Decay Streams ⋮ Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs ⋮ Unnamed Item

This page was built for publication: Clustering Problems on Sliding Windows