Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity.
Ehsan KazemiMarko MitrovicMorteza ZadimoghaddamSilvio LattanziAmin KarbasiPublished in: CoRR (2019)
Keyphrases
- worst case
- approximation error
- memory requirements
- greedy algorithm
- computational complexity
- approximation algorithms
- lower bound
- upper bound
- error bounds
- min sum
- constant factor
- scalable video
- real time
- high levels
- increase in computational complexity
- memory space
- computing power
- computational cost
- memory size
- error tolerance
- video streaming
- memory management
- streaming data
- data streams