Login / Signup
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization.
James B. Orlin
Published in:
IPCO (2007)
Keyphrases
</>
learning algorithm
computational complexity
worst case
objective function
cost function
dynamic programming
greedy algorithm
combinatorial optimization
submodular functions
neural network
optimal solution
feature space
pairwise
search space
expectation maximization