Open AccessJournal Article
'Ads' Algorithm for Subset Sum Problem
TL;DR: This paper is introducing a new technique to find the solution of Subset Sum Problem based on the simple mathematics concept and binary search.
read more
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. General Terms Algorithm, NP Complete.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Oscar H. Ibarra,Chul Kim +1 more
TL;DR: An algorithm is presented which finds for any 0 < e < 1 an approximate solution P satisfying (P* P)/P* < ~, where P* is the desired optimal sum.
1K
Fast Approximation Algorithms for Knapsack Problems
TL;DR: These algorithms are based on ideas of Ibarra and Kim, with modifications which yield better time and space bounds, and also tend to improve the practicality of the procedures.
506