On the public citation graph

Semi-Streaming Set Cover

0 signed · 45 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11538462_15openalex-snapshot
Finding Graph Matchings in Data Streams
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-642-02930-1_27openalex-snapshot
Graph Sparsification in the Semi-streaming Model
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_54openalex-snapshot
Streaming Algorithms for Independent Sets
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_26openalex-snapshot
Space-Constrained Interval Selection
inferredcites →https://doi.org/10.1007/978-3-642-32512-0_20openalex-snapshot
Maximum Matching in Semi-streaming with Few Passes
inferredcites →https://doi.org/10.1007/978-3-662-04565-7openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1007/978-3-662-43948-7_38openalex-snapshot
Semi-Streaming Set Cover
inferredcites →https://doi.org/10.1007/978-3-662-45174-8_33openalex-snapshot
On Streaming and Communication Complexity of the Set Cover Problem
inferredcites →https://doi.org/10.1007/s000370050018openalex-snapshot
On Randomized One-round Communication Complexity
inferredcites →https://doi.org/10.1007/s00224-012-9396-1openalex-snapshot
Spectral Sparsification in the Semi-streaming Setting
inferredcites →https://doi.org/10.1007/s00453-015-9995-8openalex-snapshot
Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/j.ipl.2007.11.001openalex-snapshot
Streaming algorithm for graph spanners—single pass and constant processing time per edge
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.013openalex-snapshot
On graph problems in a semi-streaming model
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1109/focs.2014.66openalex-snapshot
Single Pass Spectral Sparsification in Dynamic Streams
inferredcites →https://doi.org/10.1137/060661946openalex-snapshot
The Online Set Cover Problem
inferredcites →https://doi.org/10.1137/070683155openalex-snapshot
Graph Distances in the Data-Stream Model
inferredcites →https://doi.org/10.1137/1.9780898715859openalex-snapshot
Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/1.9781611972795.60openalex-snapshot
On Maximum Coverage in the Streaming Model & Application to Multi-topic Blog-Watch
inferredcites →https://doi.org/10.1137/1.9781611973730openalex-snapshot
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
inferredcites →https://doi.org/10.1137/100801901openalex-snapshot
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model
inferredcites →https://doi.org/10.1137/100802888openalex-snapshot
Set Covering with Our Eyes Closed
inferredcites →https://doi.org/10.1137/110858021openalex-snapshot
Adversarial Leakage in Games
inferredcites →https://doi.org/10.1145/1060590.1060649openalex-snapshot
Universal approximations for TSP, Steiner tree, and set cover
inferredcites →https://doi.org/10.1145/1921659.1921666openalex-snapshot
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
inferredcites →https://doi.org/10.1145/2627692.2627694openalex-snapshot
Graph stream algorithms
inferredcites →https://doi.org/10.1145/2897518.2897576openalex-snapshot
Tight bounds for single-pass streaming complexity of the set cover problem
inferredcites →https://doi.org/10.1145/2902251.2902287openalex-snapshot
Towards Tight Bounds for the Streaming Set Cover Problem
inferredcites →https://doi.org/10.1198/jasa.2006.s74openalex-snapshot
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
inferredcites →https://doi.org/10.2307/2005950openalex-snapshot
Complexity of Computer Computations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s10514-020-09936-7openalex-snapshot
Online coverage and inspection planning for 3D modeling
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00122openalex-snapshot
Random Order Online Set Cover is as Easy as Offline
inferred← citeshttps://doi.org/10.1109/icra.2017.7989737openalex-snapshot
Online inspection path planning for autonomous 3D modeling using a micro-aerial vehicle
inferred← citeshttps://doi.org/10.1109/iros.2018.8593537openalex-snapshot
Multi-Layer Coverage Path Planner for Autonomous Structural Inspection of High-Rise Structures
inferred← citeshttps://doi.org/10.1137/1.9781611976472.14openalex-snapshot
Streaming Set Cover in Practice
inferred← citeshttps://doi.org/10.1137/1.9781611977073.117openalex-snapshot
Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches
inferred← citeshttps://doi.org/10.1145/3584372.3588678openalex-snapshot
Set Cover in the One-pass Edge-arrival Streaming Model
inferred← citeshttps://doi.org/10.1145/3654933openalex-snapshot
Counterfactual Explanation at Will, with Zero Privacy Leakage
inferred← citeshttps://doi.org/10.1145/3798129.3800872openalex-snapshot
Settling the Pass Complexity of Streaming Set Cover
inferred← citeshttps://doi.org/10.14569/ijarai.2015.040607openalex-snapshot
A Heuristic Approach for Minimum Set Cover Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1907.00524openalex-snapshot
Approximate $\mathbb{F}_2$-Sketching of Valuation Functions
inferred← citeshttps://doi.org/10.48550/arxiv.2102.08476openalex-snapshot
Maximum Coverage in the Data Stream Model: Parameterized and Generalized
inferred← citeshttps://doi.org/10.48550/arxiv.2111.06842openalex-snapshot
Random Order Set Cover is as Easy as Offline
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.