On Streaming and Communication Complexity of the Set Cover Problem.

Erik D. Demaine Piotr Indyk Sepideh Mahabadi Ali Vakilian

Published in: DISC (2014)

Keyphrases

set cover
greedy algorithm
greedy heuristics
approximation algorithms
worst case
np hard
data streams
computational complexity
network flow
real time
solution space
streaming data
learning algorithm
convex hull
knapsack problem