论文信息 - A Note on Approximation Schemes for Multidimensional Knapsack Problems

A Note on Approximation Schemes for Multidimensional Knapsack Problems

Polynomial and fully polynomial approximation algorithms for single-dimensional knapsack problems have been extensively studied and a number of such algorithms constructed. This note shows that the problem of finding a fully polynomial approximation algorithm for multidimensional knapsack problems is NP-hard.

Maw-Sheng Chern | Michael J. Magazine | M. Magazine | Maw-Sheng Chern

[1] Rainer Schrader,et al. ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES , 1981 .

[2] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[3] A. Frieze,et al. Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses , 1984 .

[4] Osman Oguz,et al. A fully polynomial approximation algorithm for the 0-1 knapsack problem , 1981 .

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .

[7] Chak-Kuen Wong,et al. Approximate Algorithms for Some Generalized Knapsack Problems , 1976, Theor. Comput. Sci..

[8] Eugene L. Lawler,et al. Parameterized Approximation Scheme for the Multiple Knapsack Problem , 2009, SIAM J. Comput..