Login / Signup

A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization.

Deeparnab ChakrabartyYu ChenSanjeev Khanna
Published in: FOCS (2022)
Keyphrases
  • lower bound
  • upper bound
  • objective function
  • optimal solution
  • computational complexity
  • branch and bound