Random knapsack in expected polynomial time

Journal of Computer and System Sciences

Volumn 69, Issue 3 SPEC. ISS., 2004, Pages 306-329

  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; BUDGET CONTROL; COMPUTATIONAL COMPLEXITY; CORRELATION METHODS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

AVERAGE CASE ANALYSIS; EXACT ALGORITHMS; FAILURE PROBABILITY; KNAPSACK PROBLEM;

POLYNOMIALS;

EID: 4544347724     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.04.004     Document Type: Conference Paper

References (24)

1. Balas E., Zemel E. An algorithm for large zero-one knapsack problems. Oper. Res. 28:1980;1130-1154.
2. R. Beier, B. Vöcking, Random knapsack in expected polynomial time, Proceedings of the 35th ACM STOC, 2003, pp. 232-241.
3. Borgwardt K.H., Brzank J. Average saving effects in enumerative methods for solving knapsack problems. J. Complexity. 10:1994;129-141.
4. Dantzig G.B. Discrete variable extremum problems. Oper. Res. 5:1957;266-277.
5. D'Atri G., Puech C. Probabilistic analysis of the subset-sum problem. Discrete Appl. Math. 4:1982;329-334.
6. Dyer M.E., Frieze A.M. Probabilistic analysis of the multidimensional knapsack problem. Math. Oper. Res. 14(1):1989;162-176.
7. Fayard D., Plateau G. An algorithm for the solution of the 0-1 knapsack problem. Computing. 28:1982;269-287.
8. Frieze A.M. On the Lagarias-Odlyzko algorithm for the subset-sum problem. SIAM J. Comput. 15(2):1986;536-539.
9. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness. 1979;Freeman, New York.
10. A. Goldberg, 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), 1984, pp. 359-368.
11. Horowitz E., Sahni S. Computing partitions with applications to the knapsack problem. J. Assoc. Comput. Mach. 21:1974;277-292.
12. Impagliazzo R., Naor M. Efficient cryptographic schemes provably as secure as subset sum. J. Cryptology. 9(4):1996;199-216.
13. Kellerer H., Pferschy U., Pisinger D. Knapsack Problems. 2004;Springer, Berlin.
14. Lueker G.S. On the average difference between the solutions to linear and integer knapsack problems. Applied Probability - Computer Science, the Interface. Vol. 1:1982;Birkhauser, Basel.
15. Lueker G.S. Average-case analysis of off-line and on-line knapsack problems. J. Algorithms. 19:1998;277-305.
16. Lueker G.S. Exponentially small bounds on the expected optimum of the partition and subset sum problems. Random Structures Algorithms. 12:1998;51-62.
17. Martello S., Pisinger D., Toth P. New trends in exact algorithms for the 0/1 knapsack problem. European J. Oper. Res. 123:2000;325-332.
18. Martello S., Toth P. Knapsack Problems - Algorithms and Computer Implementations. 1990;Wiley, New York.
19. Nemhauser G., Ullmann Z. Discrete dynamic programming and capital allocation. Management Sci. 15(9):1969;494-505.
20. C.H. Papadimitriou, M. Yannakakis, The complexity of tradeoffs and optimal access of web sources, 41st IEEE Symposium on Foundations of Computer Science (FOCS), 2000, pp. 86-92.
21. D. Pisinger, Algorithms for knapsack problems, Ph.D. Thesis, DIKU, University of Copenhagen, 1995.
22. D. Pisinger, P. Toth, Knapsack problems, in: D-Z. Du, P. Pardalos (Eds.), Handbook of Combinatorial Optimization, Vol. 1, Kluwer Academic Publishers, Dordrecht, 1998, pp. 299-428.
23. D.A. Spielman, 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), 2001, pp. 296-305.
24. Weingartner H.M., Ness D.N. Methods for the solution of the multi-dimensional 0/1 knapsack problem. Oper. Res. 15(1):1967;83-103.