Towards Tight Bounds for the Streaming Set Cover Problem.
Sariel Har-PeledPiotr IndykSepideh MahabadiAli VakilianPublished in: PODS (2016)
Keyphrases
- tight bounds
- set cover
- upper bound
- greedy algorithm
- approximation algorithms
- np hard
- network flow
- greedy heuristics
- solution space
- greedy heuristic
- lower bound
- streaming data
- data streams
- worst case
- convex hull
- video streaming
- real time
- primal dual
- optimal solution
- special case
- np complete
- linear programming
- scheduling problem
- multi objective
- mathematical model