Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotone Submodular Maximization.
Norman HuangAllan BorodinPublished in: CoRR (2013)
Keyphrases
- worst case
- upper bound
- learning algorithm
- objective function
- computationally efficient
- brute force
- greedy algorithm
- times faster
- computationally expensive
- optimization problems
- computational complexity
- computational cost
- theoretical analysis
- benchmark datasets
- significant improvement
- evolutionary algorithm
- memory requirements
- lower and upper bounds
- search algorithm
- theoretical guarantees