Towards a theory of parameterized streaming algorithms

DOI10.4230/LIPIcs.IPEC.2019.7OpenAlexW2996936689MaRDI QIDQ5875539

Graham Cormode, Rajesh Chitnis

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1911.09650

zbMATH Keywords

kernelsstreaming algorithmsparameterized algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (5)

Streaming deletion problems parameterized by vertex cover ⋮ Streaming deletion problems Parameterized by vertex cover ⋮ FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective ⋮ Fixed parameter tractability of graph deletion problems over data streams ⋮ Linear-time parameterized algorithms with limited local resources

This page was built for publication: Towards a theory of parameterized streaming algorithms