Research Article
‘Ads’ Algorithm for Subset Sum Problem
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 66 - Issue 13 |
| Published: March 2013 |
| Authors: Adarsh Kumar Verma |
10.5120/11146-6231
|
Adarsh Kumar Verma . ‘Ads’ Algorithm for Subset Sum Problem. International Journal of Computer Applications. 66, 13 (March 2013), 32-34. DOI=10.5120/11146-6231
@article{ 10.5120/11146-6231,
author = { Adarsh Kumar Verma },
title = { ‘Ads’ Algorithm for Subset Sum Problem },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 66 },
number = { 13 },
pages = { 32-34 },
doi = { 10.5120/11146-6231 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A Adarsh Kumar Verma
%T ‘Ads’ Algorithm for Subset Sum Problem%T
%J International Journal of Computer Applications
%V 66
%N 13
%P 32-34
%R 10.5120/11146-6231
%I Foundation of Computer Science (FCS), NY, USA
Abstract
The Subset Sum Problem is an important problem in Complexity Theory, Bin Packing and Cryptography. The Subset Sum Problem is NP Complete. In this paper we are introducing a new technique to find the solution of Subset Sum Problem. There are many algorithms based on greedy approach and lattice based reduction and many more approaches has been suggested earlier but suggested approach is based on the simple mathematics concept and binary search.
References
- M. R. Garey& D. S. Johnson, Computers and Intractibility: A Guide to the theory of NP Completeness, W. H. Freeman and Company, New York (1979).
- Harsh Bhasin and NehaSingla, "Harnessing Cellular Automata and Genetic Algorithms to solve Travelling Salesman Problem".
- O. H. Ibarra and C. E. Kim, Fast approximation algorithms for knapsack and sum of subset problem, journal of the ACM, 22, 463-468(1975).
- E. L. Lawler, Fast approximation algorithms for Knapsack problems, Mathematics of operation research, 4,339-356 (1979)
- S. Martello and P. Toth, Worst case analysis of greedy algorithms for the subset sum problem, Mathematical Programming, 28,198-205 (1984).
- S. Martello and P. Toth, Approximation schemes for the subset-sum problem: Survey and experimental analysis, European Journal of Operational Research, 22,56-69 (1985)
Index Terms
Keywords