We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

‘Ads’ Algorithm for Subset Sum Problem

by Adarsh Kumar Verma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 66 - Number 13
Year of Publication: 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 },
issue_date = { March 2013 },
volume = { 66 },
number = { 13 },
month = { March },
year = { 2013 },
issn = { 0975-8887 },
pages = { 32-34 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume66/number13/11146-6231/ },
doi = { 10.5120/11146-6231 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:22:18.676455+05:30
%A Adarsh Kumar Verma
%T ‘Ads’ Algorithm for Subset Sum Problem
%J International Journal of Computer Applications
%@ 0975-8887
%V 66
%N 13
%P 32-34
%D 2013
%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
  1. 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).
  2. Harsh Bhasin and NehaSingla, "Harnessing Cellular Automata and Genetic Algorithms to solve Travelling Salesman Problem".
  3. 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).
  4. E. L. Lawler, Fast approximation algorithms for Knapsack problems, Mathematics of operation research, 4,339-356 (1979)
  5. S. Martello and P. Toth, Worst case analysis of greedy algorithms for the subset sum problem, Mathematical Programming, 28,198-205 (1984).
  6. 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

Computer Science
Information Sciences

Keywords

Subset Sum binary search

Powered by PhDFocusTM