"Tight bounds for single-pass streaming complexity of the set cover problem."

Sepehr Assadi, Sanjeev Khanna, Yang Li (2016)

> Home

Details and statistics

DOI: 10.1145/2897518.2897576

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/AssadiKL16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/AssadiKL16
Sepehr Assadi, Sanjeev Khanna, Yang Li:
Tight bounds for single-pass streaming complexity of the set cover problem. STOC 2016: 698-711

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.