Rene Beier
ABSTRACT
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove, for various input distributions, that the number of dominating solutions (i.e., Pareto-optimal knapsack fillings) to this problem is polynomially bounded in the number of available items. An algorithm by Nemhauser and Ullmann can enumerate these solutions very efficiently so that a polynomial upper bound on the number of dominating solutions implies an algorithm with expected polynomial running time.The random input model underlying our analysis is very general and not restricted to a particular input distribution. We assume adversarial weights and randomly drawn profits (or vice versa). Our analysis covers general probability distributions with finite mean, and, in its most general form, can even handle different probability distributions for the profits of different items. This feature enables us to study the effects of correlations between profits and weights. Our analysis confirms and explains practical studies showing that so-called strongly correlated instances are harder to solve than weakly correlated ones.
- E. Balas and E. Zemel. An algorithm for large zero-one knapsack problems. Operations Research, Vol. 28, pp. 1130--1154, 1980.Google Scholar
Cross Ref
- K. H. Borgwardt and J. Brzank. Average Saving Effects in Enumerative Methods for Solving Knapsack Problems. J. of Complexity 10, pp. 129--141, 1994. Google ScholarDigital Library
- M. Coster, A. Joux, B. LaMacchia, A. Odlyzko, C. P. Schnorr, J. Stern. Improved Low-Density Subset Sum Algorithms. J. of Computational Complexity, 111--128, 1992. Google ScholarDigital Library
- G. B. Dantzig. Discrete Variable Extremum Problems. Operations Research, Vol 5, pp. 266--277, 1957.Google ScholarDigital Library
- G. D'Atri and C. Puech. Probabilistic Analysis of the Subset-Sum Problem. Discrete Applied Math., Vol 4, 329--334, 1982.Google Scholar
- M. E. Dyer and A. M. Frieze. Probabilistic Analysis of the Multidimensional Knapsack Problem. Mathematics of Operations Research 14(1), 162--176, 1989. Google ScholarDigital Library
- D. Fayard and G. Plateau. An algorithm for the solution of the 0-1 knapsack problem. Computing, Vol. 28, pp. 269--287, 1982.Google ScholarCross Ref
- A. M. Frieze. On the Lagarias-Odlyzko algorithm for the Subset-Sum Problem. SIAM J. Comput. 15(2), 536--539, 1986. Google ScholarDigital Library
- M. R. Garey and D. S~Johnson. Computers and Intractability: A Guide to the Theory of NP completeness. Freeman, 1979. Google ScholarDigital Library
- S. Martello, D. Pisinger and P. Toth. New Trends in Exact Algorithms for the 0/1 Knapsack Problem. European Journal of Operational Research, Vol. 123, pp. 325--332, 2000.Google ScholarCross Ref
- S. Martello and P. Toth. Knapsack Problems -- Algorithms and Computer Implementations. Wiley, 1990. Google ScholarDigital Library
- A. Goldberg and A. Marchetti-Spaccamela. On Finding the Exact Solution to a Zero-One Knapsack Problem. Proceedings of the 16th ACM Symposium on Theory of Computing (STOC), 359--368, 1984. Google ScholarDigital Library
- R. Impagliazzo and M. Naor. Efficient Cryptographic Schemes Provably as Secure as Subset Sum. J. of Cryptology 9(4), 199--216, 1996.Google ScholarDigital Library
- G. S. Lueker. On the Average Difference Between the Solutions to Linear and Integer Knapsack Problems. Applied Probability - Computer Science, the Interface, 1, Birkhauser, 1982.Google Scholar
- G. S. Lueker. Average-Case Analysis of Off-Line and On-Line Knapsack Problems. J. of Algorithms, 19, 277--305, 1998. Google ScholarDigital Library
- G. S. Lueker. Exponentially Small Bounds on the Expected Optimum of the Partition and Subset Sum Problems. Random Structures and Algorithms, 12, 51--62, 1998. Google ScholarDigital Library
- G. Nemhauser and Z. Ullmann. Discrete Dynamic Programming and Capital Allocation. Management Science, 15(9), 494--505, 1969.Google Scholar
- E. Horowitz and S. Sahni. Computing Partitions with Applications to the Knapsack Problem, J. of the ACM, Vol. 21, 277--292, 1974. Google ScholarDigital Library
- D. Pisinger. Algorithms for Knapsack Problems. Ph.D. thesis, DIKU, University of Copenhagen, 1995.Google Scholar
- D. Pisinger and P. Toth. Knapsack Problems. In D-Z. Du, P. Pardalos (ed.), Handbook of Combinatorial Optimization, vol. 1, Kluwer Academic Publishers, 299--428, 1998.Google Scholar
- D. A. Spielman and Shang-Hua Teng. Smoothed Analysis of Algorithms: Why The Simplex Algorithm Usually Takes Polynomial Time. Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC), 296--305, 2001. Google ScholarDigital Library
- H.M. Weingartner and D.N. Ness. Methods for the Solution of the Multi-Dimensional 0/1 Knapsack problem. Operations Research, Vol. 15, No. 1, 83--103, 1967.Google ScholarDigital Library
Index Terms
- Random knapsack in expected polynomial time
Recommendations
Random knapsack in expected polynomial time
Special issue: STOC 2003We present the first average-case analysis proving a polynomial upper bound on the expected running time of an exact algorithm for the 0/1 knapsack problem. In particular, we prove for various input distributions, that the number of Pareto-optimal ...
Parameterized Approximation Scheme for the Multiple Knapsack Problem
The multiple knapsack problem (MKP) is a well-known generalization of the classical knapsack problem. We are given a set $A$ of $n$ items and set $B$ of $m$ bins (knapsacks) such that each item $a \in A$ has a size $size(a)$ and a profit value $profit(a)...
On parameterized exponential time complexity
In this paper we study the notion of parameterized exponential time complexity. We show that a parameterized problem can be solved in parameterized 2^o^(^f^(^k^)^)p(n) time if and only if it is solvable in time O(2^@d^f^(^k^)q(n)) for any constant @d>0, ...
Comments