Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Sepehr Assadi, Sanjeev Khanna, Yang Li 0025. Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem. SIAM Journal on Computing, 50(3), 2021. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Tight bounds for single-pass streaming complexity of the set cover problemSepehr Assadi, Sanjeev Khanna, Yang Li. stoc 2016: 698-711 [doi] Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover ProblemSepehr Assadi. PODS 2017: 321-335 [doi]
The following publications are possibly variants of this publication: