Login / Signup
Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem.
Sepehr Assadi
Sanjeev Khanna
Yang Li
Published in:
CoRR (2016)
Keyphrases
</>
single pass
tight bounds
set cover
stream mining
upper bound
greedy algorithm
approximation algorithms
greedy heuristics
worst case
network flow
regression forests
data streams
np hard
simulated annealing
computational complexity
objective function
genetic algorithm
decision trees