Computing diameter in the streaming and sliding-window models
From MaRDI portal
Publication:1763145
DOI10.1007/s00453-004-1105-2zbMath1082.68020OpenAlexW2007025103MaRDI QIDQ1763145
Sampath Kannan, Jian Zhang, Joan Feigenbaum
Publication date: 21 February 2005
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-004-1105-2
Related Items
Dynamic coresets, Optimal sampling from sliding windows, Sketching asynchronous data streams over sliding windows, From approximate balls to approximate ellipses, Improved Algorithms for Time Decay Streams, Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows., Adaptive sampling for geometric problems over data streams, Faster core-set constructions and data-stream algorithms in fixed dimensions, GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS, Unnamed Item
