New Approximations and Hardness Results for Submodular Partitioning Problems.

Richard Santiago

Published in: CoRR (2020)

Keyphrases

np complete
neural network
problems involving
high order
information systems
application domains
similarity measure
database
lower bound
optimization problems
computational complexity
np hardness
graph cuts
case study
computer vision
genetic algorithm
real time