Login / Signup
A polynomial time algorithm for finding a minimum 4-partition of a submodular function.
Tsuyoshi Hirayama
Yuhao Liu
Kazuhisa Makino
Ke Shi
Chao Xu
Published in:
Math. Program. (2024)
Keyphrases
</>
learning algorithm
worst case
computational complexity
dynamic programming
greedy algorithm
optimal solution
np hard
submodular functions
combinatorial optimization
mathematical model
objective function
denoising
simulated annealing
particle swarm optimization
special case
search space
lower bound