Maximum coverage in random-arrival streams

DOI10.4230/LIPICS.ESA.2023.102MaRDI QIDQ6657073zbMATH OpenFDO

Authors Rowan Warneke, Farhana Choudhury, Anthony Wirth

Publication date 6 January 2025

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

zbMATH Keywords

communication complexitygreedy algorithmmaximum coveragerandom arrivalstreaming algorithm

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Improved algorithms for maximum coverage in dynamic and random order streams

This page was built for publication: Maximum coverage in random-arrival streams

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