International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 114 - Issue 14 |
Published: March 2015 |
Authors: Hashem A. Isa, Saleh Oqeili, Sulieman Bani-Ahmad |
![]() |
Hashem A. Isa, Saleh Oqeili, Sulieman Bani-Ahmad . The Subset-Sum Problem: Revisited with an Improved Approximated Solution. International Journal of Computer Applications. 114, 14 (March 2015), 1-5. DOI=10.5120/20043-7214
@article{ 10.5120/20043-7214, author = { Hashem A. Isa,Saleh Oqeili,Sulieman Bani-Ahmad }, title = { The Subset-Sum Problem: Revisited with an Improved Approximated Solution }, journal = { International Journal of Computer Applications }, year = { 2015 }, volume = { 114 }, number = { 14 }, pages = { 1-5 }, doi = { 10.5120/20043-7214 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2015 %A Hashem A. Isa %A Saleh Oqeili %A Sulieman Bani-Ahmad %T The Subset-Sum Problem: Revisited with an Improved Approximated Solution%T %J International Journal of Computer Applications %V 114 %N 14 %P 1-5 %R 10.5120/20043-7214 %I Foundation of Computer Science (FCS), NY, USA
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.