| Title: |
Tight bounds for single-pass streaming complexity of the set cover problem |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Sepehr Assadi |
-
University of Pennsylvania, Department of Computer and Information Science
|
| Sanjeev Khanna |
-
University of Pennsylvania, Department of Computer and Information Science
|
| Yang Li |
-
University of Pennsylvania, Department of Computer and Information Science
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1116961,
1552909,
1447470
|
| DBLP Key: |
conf/stoc/AssadiKL16
|
| Author Comments: |
|