Computing diameter in the streaming and sliding-window models

DOI10.1007/S00453-004-1105-2MaRDI QIDQ1763145zbMATH OpenOpenAlexFDO

Authors Joan Feigenbaum, Sampath Kannan, Jian Zhang

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

zbMATH Keywords

DiameterMassive data streamsSliding window

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 6820208
• Algorithms and Computation
• GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS
• Streaming algorithms for extent problems in high dimensions
• scientific article; zbMATH DE number 6297803

Cited in

(16)

• Sketching asynchronous data streams over sliding windows
• From approximate balls to approximate ellipses
• Adaptive sampling for geometric problems over data streams
• Faster core-set constructions and data-stream algorithms in fixed dimensions
• Optimal sampling from sliding windows
• scientific article; zbMATH DE number 6820208 (Why is no real title available?)
• Nearly optimal distinct elements and heavy hitters on sliding windows
• GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS
• Separating Sublinear Time Computations by Approximate Diameter
• Algorithms and Computation
• scientific article; zbMATH DE number 7053290 (Why is no real title available?)
• Improved Algorithms for Time Decay Streams
• Regular languages in the sliding window model
• Streaming algorithms for geometric Steiner forest
• k-center with outliers in sliding windows
• Dynamic coresets

This page was built for publication: Computing diameter in the streaming and sliding-window models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763145)