Approximating Knapsack and Partition via Dense Subset Sums.

Mingyang Deng Ce Jin Xiao Mao

Published in: CoRR (2023)

Keyphrases

disjoint subsets
knapsack problem
dynamic programming
similarity measure
multiresolution
data mining
upper bound
np hard
optical flow fields
vertex set
stereo correspondence
packing problem
evolutionary algorithm
optimal solution
case study
artificial intelligence
learning algorithm
information retrieval