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]
@article{AssadiKL21,
title = {Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem},
author = {Sepehr Assadi and Sanjeev Khanna and Yang Li 0025},
year = {2021},
doi = {10.1137/16M1095482},
url = {https://doi.org/10.1137/16M1095482},
researchr = {https://researchr.org/publication/AssadiKL21},
cites = {0},
citedby = {0},
journal = {SIAM Journal on Computing},
volume = {50},
number = {3},
}