186 search results - page 1 / 38 » Priority Algorithms for the Subset-Sum Problem |
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
PODS
2005
ACM
14 years 5 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
FCT
1991
Springer
13 years 8 months ago
1991
Springer
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
ICALP
1998
Springer
13 years 9 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...