The Subset-Sum Problem: Revisited with an Improved Approximated Solution
Hashem A.Isa, Saleh Al-Oqaili, Sulieman Bani‐Ahmad · International Journal of Computer Applications · 2015
The Subset-sum Problem is one of the easiest to describe and understand NP-complete problems.Available algorithms that solve this problem exactly need an exponential time, thus finding a solution to this problem is not currently feasible.The current paper revisits the subset-sum problem and suggests a new approach to find an approximate solution to this problem.The proposed algorithm gives a reasonable solution with a polynomial time-complexity.