A polynomial lower bound on adaptive complexity of submodular maximization.
Wenzheng LiPaul LiuJan VondrákPublished in: CoRR (2020)
Keyphrases
- lower bound
- objective function
- average case complexity
- worst case
- upper bound
- greedy algorithm
- branch and bound algorithm
- computational complexity
- vapnik chervonenkis dimension
- polynomial hierarchy
- complexity analysis
- lower and upper bounds
- optimal solution
- data sets
- decision problems
- vc dimension
- energy minimization
- branch and bound
- sufficiently accurate
- computational cost