Random knapsack in expected polynomial time

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 232-241

  Beier, Rene ^a   Vöcking, Berthold ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Average case analysis; Exact algorithms; Knapsack problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; INTEGER PROGRAMMING; OPTIMIZATION; THEOREM PROVING;

EXACT ALGORITHMS;

COMPUTATION THEORY;

EID: 0037770115     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780575.780578     Document Type: Conference Paper

References (22)

1. E. Balas and E. Zemel. An algorithm for large zero-one knapsack problems. Operations Research, Vol. 28, pp. 1130-1154, 1980.
2. K. H. Borgwardt and J. Brzank. Average Saving Effects in Enumerative Methods for Solving Knapsack Problems. J. of Complexity 10, pp. 129-141, 1994.
3. M. Coster, A. Joux, B. LaMacchia, A. Odlyzko, C. P. Schnorr, J. Stem. Improved Low-Density Subset Sum Algorithms. J. of Computational Complexity, 111-128, 1992.
4. G. B. Dantzig. Discrete Variable Extremum Problems. Operations Research, Vol 5, pp. 266-277, 1957.
5. G. D'Atri and C. Puech. Probabilistic Analysis of the Subset-Sum Problem. Discrete Applied Math., Vol 4, 329-334, 1982.
6. M. E. Dyer and A. M. Frieze. Probabilistic Analysis of the Multidimensional Knapsack Problem. Mathematics of Operations Research 14(1), 162-176, 1989.
7. D. Fayard and G. Plateau. An algorithm for the solution of the 0-1 knapsack problem. Computing, Vol. 28, pp. 269-287, 1982.
8. A. M. Frieze. On the Lagarias-Odlyzko algorithm for the Subset-Sum Problem. SIAM J. Comput. 15(2), 536-539,1986.
9. M. R. Garey and D. S Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.
10. 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.
11. S. Martello and P. Toth. Knapsack Problems - Algorithms and Computer Implementations. Wiley, 1990.
12. 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.
13. R. Impagliazzo and M. Naor. Efficient Cryptographic Schemes Provably as Secure as Subset Sum. J. of Cryptology 9(4), 199-216, 1996.
14. 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.
15. G. S. Lueker. Average-Case Analysis of Off-Line and On-Line Knapsack Problems. J. of Algorithms, 19, 277-305, 1998.
16. 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.
17. G. Nemhauser and Z. Ullmann, Discrete Dynamic Programming and Capital Allocation. Management Science, 15(9), 494-505, 1969.
18. E. Horowitz and S. Sahni. Computing Partitions with Applications to the Knapsack Problem, J. of the ACM, Vol. 21, 277-292,1974.
19. D. Pisinger. Algorithms for Knapsack Problems. Ph.D. thesis, DIKU, University of Copenhagen, 1995.
20. 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.
21. 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.
22. 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.