Semi-Streaming Set Cover
From MaRDI portal
Publication:5167764
DOI10.1007/978-3-662-43948-7_38zbMath1410.68407OpenAlexW2567730220MaRDI QIDQ5167764
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_38
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Data structures (68P05) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (5)
Streaming algorithms for independent sets in sparse hypergraphs ⋮ Unnamed Item ⋮ Fractional Set Cover in the Streaming Model. ⋮ Better streaming algorithms for the maximum coverage problem ⋮ Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem
This page was built for publication: Semi-Streaming Set Cover
