Sign in
A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice.
Qingqin Nong
Jiazhu Fang
Suning Gong
Ding-Zhu Du
Yan Feng
Xiaoying Qu
Published in:
J. Comb. Optim. (2020)
Keyphrases
</>
submodular functions
cost function
np hard
neural network
learning algorithm
optimal solution
computational complexity
dynamic programming
combinatorial optimization
similarity measure
search space
worst case
energy function
lattice structure
probabilistic model
linear programming