Login / Signup
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection.
Deeparnab Chakrabarty
Yu Chen
Sanjeev Khanna
Published in:
CoRR (2021)
Keyphrases
</>
lower bound
greedy algorithm
submodular functions
objective function
upper bound
worst case
higher order
image restoration
facility location problem