Interval selection in sliding windows

DOI10.4230/LIPICS.ESA.2024.8MaRDI QIDQ7253058zbMATH OpenFDO

Authors Cezar-Mihail Alexandru, Christian Konrad

Publication date 26 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2024.8

zbMATH Keywords

interval selectionsliding window algorithmsstreaming algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A \((2+\epsilon)\)-approximation for maximum weight matching in the semi-streaming model
• Almost-smooth histograms and sliding-window graph algorithms
• Communication Complexity
• Dynamic Graphs in the Sliding-Window Model
• scientific article; zbMATH DE number 2119721 (Why is no real title available?)
• scientific article; zbMATH DE number 7788646 (Why is no real title available?)
• Improved weighted matching in the sliding window model
• Interval selection in data streams: weighted intervals and the insertion-deletion setting
• Interval selection in the streaming model
• Space-constrained interval selection
• The one-way communication complexity of Hamming distance
• The one-way communication complexity of submodular maximization with applications to streaming and robustness

This page was built for publication: Interval selection in sliding windows

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