arXiv (All)
open access
Settling the Pass Complexity of Streaming Set Cover
In the streaming set cover problem, $m$ sets from a universe of size $n$ are arriving one by one in a stream, and the algorithm is allowed to process the stream using one or a few passes and a space of $o(mn)$, which is sublinear in the input size. The goal is to determine the minimal (or approximat
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Subquadratic-Query Algorithms for Finding Another Maximum Matroid Intersection#1011893
- The Sharp Dimension Bound in the Johnson--Lindenstrauss Lemma#662472
- The Sharp Dimension Bound in the Johnson--Lindenstrauss Lemma#661422
- Awesome graph parameters#1063805
- STEM2: A Fast and Space-efficient Data Structure for Exact Multi-Set Membership Query#386988
Record · ID 1155942
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive