Solving low-density subset sum problems
Journal of the ACM (JACM)
On the Lagarias-Odlyzko algorithm for the subset sum problem
SIAM Journal on Computing
Solving dense subset-sum problems by using analytical number theory
Journal of Complexity
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
An almost linear-time algorithm for the dense subset-sum problem
SIAM Journal on Computing
Improved low-density subset sum algorithms
Computational Complexity
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Phase transition and finite-size scaling for the integer partitioning problem
Random Structures & Algorithms - Special issue on analysis of algorithms dedicated to Don Knuth on the occasion of his (100)8th birthday
Random knapsack in expected polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An efficient fully polynomial approximation scheme for the Subset-Sum problem
Journal of Computer and System Sciences
Where are the hard knapsack problems?
Computers and Operations Research
Solving medium-density subset sum problems in expected polynomial time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Hi-index | 0.00 |
The subset sum problem (SSP) can be briefly stated as: given a target integer Eand a set Acontaining npositive integer aj, find a subset of Asumming to E. The densitydof an SSP instance is defined by the ratio of nto m, where mis the logarithm of the largest integer within A. Based on the structural and statistical properties of subset sums, we present an improved enumeration scheme for SSP, and implement it as a complete and exact algorithm (EnumPlus). The algorithm always equivalently reduces an instance to be low-density, and then solve it by enumeration. Through this approach, we show the possibility to design a sole algorithm that can efficiently solve arbitrary density instance in a uniform way. Furthermore, our algorithm has considerable performance advantage over previous algorithms. Firstly, it extends the density scope, in which SSP can be solved in expected polynomial time. Specifically, It solves SSP in expected O(nlogn) time when density $d \geq c\cdot \sqrt{n}/\log{n}$, while the previously best density scope is d驴 c·n/(logn)2. In addition, the overall expected time and space requirement in the average case are proven to be O(n5logn) and O(n5) respectively. Secondly, in the worst case, it slightly improves the previously best time complexity of exact algorithms for SSP. The worst-case time complexity of our algorithm is proved to be O(n·2n/2驴 c·2n/2+ n), while the previously best result is O(n·2n/2).