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 ∈ A has a size size(a) and a profit value profit(a), and each bin b ∈ B has a capacity c(b). The goal is to find a subset U ⊂ A of maximum total profit such that U can be packed into B without exceeding the capacities. The decision version of MKP is strongly NP-complete, since it is a generalization of the classical knapsack and bin packing problem. Furthermore, MKP does not admit an FPTAS even if the number m of bins is two. Kellerer gave a PTAS for MKP with identical capacities and Chekuri and Khanna presented a PTAS for MKP with general capacities with running time nO(log(1/e)/e8). In this paper we propose an EPTAS with parameterized running time 2O(log(1/e)/e5) · poly(n) + O(m) for MKP. This solves also an open question by Chekuri and Khanna.

[1]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[2]  Michael R. Fellows,et al.  Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT , 2003, WG.

[3]  Uri Zwick,et al.  Selecting the median , 1995, SODA '95.

[4]  Sanjeev Khanna,et al.  A PTAS for the multiple knapsack problem , 2000, SODA '00.

[5]  Sanjeev Khanna,et al.  A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem , 2005, SIAM J. Comput..

[6]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[7]  Hans Kellerer,et al.  A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem , 1999, J. Comb. Optim..

[8]  Angelika Steger,et al.  Approximability of scheduling with fixed jobs , 1999, SODA '99.

[9]  Hans Kellerer,et al.  Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem , 2004, J. Comb. Optim..

[10]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[11]  Eugene L. Lawler,et al.  Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[12]  Éva Tardos,et al.  Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..

[13]  Egon Balas,et al.  An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

[14]  Leonid Khachiyan,et al.  Approximate Max-Min Resource Sharing for Structured Concave Optimization , 2000, SIAM J. Optim..

[15]  Claire Mathieu,et al.  Approximate strip packing , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[16]  Hans Kellerer,et al.  A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem , 1999, RANDOM-APPROX.

[17]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).