Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Fast Approximation Algorithm for the Subset‐sum Problem

A Fast Approximation Algorithm for the Subset‐sum Problem The subset‐sum problem (SSP) is defined as follows: given a positive integer bound and a set of n positive integers find a subset whose sum is closest to, but not greater than, the bound. We present a randomized approximation algorithm for this problem with linear space complexity and time complexity of O(n log n). Experiments with random uniformly‐distributed instances of SSP show that our algorithm outperforms, both in running time and average error, Martello and Toth's (1984) quadratic greedy search, whose time complexity is O(n2). We propose conjectures on the expected error of our algorithm for uniformly‐distributed instances of SSP and provide some analytical arguments justifying these conjectures. We present also results of numerous tests. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Transactions in Operational Research Wiley

A Fast Approximation Algorithm for the Subset‐sum Problem

Loading next page...
 
/lp/wiley/a-fast-approximation-algorithm-for-the-subset-sum-problem-dV5UumzNlY

References (9)

Publisher
Wiley
Copyright
International Federation of Operational Research Societies 2002
ISSN
0969-6016
eISSN
1475-3995
DOI
10.1111/1475-3995.00366
Publisher site
See Article on Publisher Site

Abstract

The subset‐sum problem (SSP) is defined as follows: given a positive integer bound and a set of n positive integers find a subset whose sum is closest to, but not greater than, the bound. We present a randomized approximation algorithm for this problem with linear space complexity and time complexity of O(n log n). Experiments with random uniformly‐distributed instances of SSP show that our algorithm outperforms, both in running time and average error, Martello and Toth's (1984) quadratic greedy search, whose time complexity is O(n2). We propose conjectures on the expected error of our algorithm for uniformly‐distributed instances of SSP and provide some analytical arguments justifying these conjectures. We present also results of numerous tests.

Journal

International Transactions in Operational ResearchWiley

Published: Jul 1, 2002

There are no references for this article.