Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem

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]

Authors

Sepehr Assadi

This author has not been identified. Look up 'Sepehr Assadi' in Google

Sanjeev Khanna

This author has not been identified. Look up 'Sanjeev Khanna' in Google

Yang Li 0025

This author has not been identified. Look up 'Yang Li 0025' in Google