There is no EPTAS for two-dimensional knapsack

Information Processing Letters

Volumn 110, Issue 16, 2010, Pages 707-710

  Kulik, Ariel ^a   Shachnai, Hadas ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Efficient polynomial time approximation schemes; Parameterized complexity; Theory of computation; Two dimensional knapsack

Indexed keywords

0-1 KNAPSACK PROBLEM; APPROXIMATION SCHEME; EXPONENTIAL TIME; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; KNAPSACK PROBLEMS; PARAMETERIZED COMPLEXITY; POLYNOMIAL TIME APPROXIMATION SCHEMES; PROBABILISTIC ANALYSIS; RUNNING TIME;

BINS; COMPUTATION THEORY; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION; PROFITABILITY; PROGRAM PROCESSORS; TWO DIMENSIONAL;

APPROXIMATION ALGORITHMS;

EID: 77953651617     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.05.031     Document Type: Article

References (16)

1. Caprara A., Kellerer H., Pferschy U., and Pisinger D. Approximation algorithms for knapsack problems with cardinality constraints. European J. Oper. Res. 123 2 (2000) 333-345
2. Chen J., Huang X., Kanj I.A., and Xia G. Linear FPT reductions and computational lower bounds. STOC '04: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing (2004), ACM, New York 212-221
3. Downey R.G., and Fellows M. Parameterized Complexity. Monogr. Comput. Sci. (1999), Springer-Verlag
4. Downey R.G., and Fellows M.R. Fixed-parameter tractability and completeness II: On completeness for W [1]. Theoret. Comput. Sci. 141 1-2 (1995) 109-131
5. Flum J., and Grohe M. Parameterized Complexity Theory. Texts Theoret. Comput. Sci. EATCS Ser. (2006), Springer-Verlag New York, Inc., Secaucus, NJ
6. Frieze A.M., and Clarke M. Approximation algorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses. European J. Oper. Res. 15 1 (1984) 100-109
7. Gens G., and Levner E. Complexity of approximation algorithms for combinatorial problems: a survey. SIGACT News 12 3 (1980) 52-65
8. In: Hochbaum D.S. (Ed). Approximation Algorithms for NP-Hard Problems (1996), PWS Publishing Co., Boston, MA
9. Jansen K. Parameterized approximation scheme for the multiple knapsack problem. In: Mathieu C. (Ed). Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2009), SIAM 665-674
10. Kellerer H., and Pferschy U. A new fully polynomial approximation scheme for the knapsack problem. J. Comb. Optim. 3 (1999) 59-71
11. Kellerer H., and Pferschy U. Improved dynamic programming in connection with an FPTAS for the knapsack problem. J. Comb. Optim. 8 1 (2004) 5-11
12. Kellerer H., Pferschy U., and Pisinger D. Knapsack Problems (October 2004), Springer-Verlag
13. Korte B., and Schrader R. On the existence of fast approximation schemes. Nonlinear Programming 4 (1981) 415-437
14. Magazine M.J., and Chern M.-S. A note on approximation schemes for multidimensional knapsack problems. Math. Oper. Res. 9 2 (1984) 244-247
15. Papadimitriou C.H., and Yannakakis M. Optimization, approximation, and complexity classes. J. Comput. System Sci. 43 3 (1991) 425-440
16. Vazirani V. Approximation Algorithms (2001), Springer-Verlag