A Polynomial-Time Algorithm for Special Cases of the Unbounded Subset-Sum Problem.
Majid SalimiHamid MalaPublished in: CoRR (2021)
Keyphrases
- special case
- np hard
- computational complexity
- computational cost
- dynamic programming
- learning algorithm
- worst case
- improved algorithm
- search space
- approximation algorithms
- high accuracy
- preprocessing
- similarity measure
- k means
- optimal solution
- np hardness
- theoretical analysis
- segmentation algorithm
- optimization algorithm
- times faster
- recognition algorithm
- min cost
- approximation ratio
- markov networks
- strongly polynomial
- convergence rate
- classification algorithm
- clustering method
- computationally efficient
- scheduling problem
- cost function
- objective function