Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity.
Ehsan KazemiMarko MitrovicMorteza ZadimoghaddamSilvio LattanziAmin KarbasiPublished in: ICML (2019)
Keyphrases
- constant factor
- worst case
- lower bound
- approximation algorithms
- greedy algorithm
- np hard
- objective function
- memory requirements
- space complexity
- computational complexity
- complexity analysis
- error bounds
- memory usage
- high levels
- computational cost
- real time
- scalable video
- approximation schemes
- min sum
- memory space
- computing power
- neural network
- database
- real time streaming