A lower bound for parallel submodular minimization.
Eric BalkanskiYaron SingerPublished in: STOC (2020)
Keyphrases
- lower bound
- objective function
- upper bound
- lower and upper bounds
- optimal solution
- branch and bound algorithm
- greedy algorithm
- worst case
- parallel processing
- np hard
- high order
- branch and bound
- feasible solution
- parallel implementation
- linear programming
- lower bounding
- sample complexity
- distributed memory
- neural network
- shared memory
- special case
- massively parallel
- search algorithm
- lagrangian relaxation
- parallel computation
- constant factor