The week's pick
Random Articles
Reseach Article
A New Algorithm to Provide all Solutions of SSP Problem
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 178 - Number 5 |
| Year of Publication: 2017 |
| Authors: Vishal Kesri |
10.5120/ijca2017915825
|
Vishal Kesri . A New Algorithm to Provide all Solutions of SSP Problem. International Journal of Computer Applications. 178, 5 ( Nov 2017), 20-25. DOI=10.5120/ijca2017915825
Abstract
Sum of subset (SSP) is an important problem of complexity theory and cryptography in computer science. The SSP involves searching from a given set of distinct integers to find all the subsets whose sum of elements equal to certain integer capacity. The importance of this algorithm is that, it can be applied to create a better decryption technique and in many others. The proposed algorithm is able to find all solutions of SSP from a given set of integers. Simulation shows that the algorithm takes less number of steps as compared to traditional back tracking algorithm.
References
- Yuli Ye, “Priority Algorithms for the Subset- Sum Problem” Master of Science Thesis, Graduate Department of Computer Science University of Toronto”2006”.
- M. Garey and D. Johnson.Computers and Intractability : a Guide to the Theory of NP completeness. Freeman, 1979.
- L. Escudero, S. Martello, and P. Toth. A framework for tightening 0 - 1 programs based on extensions of pure 0-1 KP and SS problems.Lecture Notes in Computer Science, 920:110–123, 1995.
- M.Garey and D. Johnson.Computers and Intractability : a Guide to the Theory of NP completeness. Freeman, 1979.
- O. Ibarra and C. Kim. Fast approximation algorithms for the knapsack and sum of subset problem. Journal of the ACM, 22:463– 468, 1975.
- H. Kellerer, R. Mansini, U. Pferschy, and M. Speranza. An efficient fully polynomial approximation scheme for the subset-sum problem. Journal of Computer and System Sciences, 66:349–370, 2003.
- H. Kellerer , U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.
- D. Pisinger. An exact algorithm for large multiple knapsack problems. European Journal of Operational Research, 114 : 528–541, 1999.
- A. Caprara and U. Pferschy. Packing bins with minima l slack. Technical report, University of Graz, 2002.
- B. Dietrich and L. Escudero. Coefficient reduction for knapsack constraints in 0-1 programs with VUBs. Operations Research Letters, 9:9–14, 1990.
- J. Hoogeveen, H. Oosterhout, and S. van de Velde. New lower and upper bounds for scheduling around a small common due date. Operations Research, 42 : 102–110-1994.
Index Terms
Keywords