A new fully polynomial approximation scheme for the subset-sum problem is presented. This algorithm yields better time and space complexity bounds, and also tends to improve the practicability of the procedure. The su...
详细信息
A new fully polynomial approximation scheme for the subset-sum problem is presented. This algorithm yields better time and space complexity bounds, and also tends to improve the practicability of the procedure. The subset-sum problem, for n items and accuracy epsilon is solved in O(min(n/epsilon, n + 1/epsilon3)) time and O(min(n/epsilon, n + 1/epsilon2)) space.
暂无评论