A fast asymptotic approximation scheme for bin packing with rejection
Theoretical Computer Science
Efficient bulk insertion into a distributed ordered table
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Near-optimal dynamic replication in unstructured peer-to-peer networks
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Parameterized approximation scheme for the multiple knapsack problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved approximation algorithms for scheduling with fixed jobs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Throughput maximization of real-time scheduling with batching
ACM Transactions on Algorithms (TALG)
On Lagrangian Relaxation and Subset Selection Problems
Approximation and Online Algorithms
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
Truthful Mechanisms via Greedy Iterative Packing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the complexity of variations of equal sum subsets
Nordic Journal of Computing
Approximation algorithms for scheduling with reservations
HiPC'07 Proceedings of the 14th international conference on High performance computing
Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for traffic grooming in WDM rings
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Approximation schemes for sequential posted pricing in multi-unit auctions
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Constrained non-monotone submodular maximization: offline and secretary algorithms
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Parameterized Approximation Scheme for the Multiple Knapsack Problem
SIAM Journal on Computing
Prompt mechanism for ad placement over time
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Theoretical Computer Science
Journal of Discrete Algorithms
Theoretical Computer Science
A fast approximation scheme for the multiple knapsack problem
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Tight approximation algorithms for scheduling with fixed jobs and nonavailability
ACM Transactions on Algorithms (TALG)
Approximation algorithms for scheduling and packing problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Approximation Techniques for Utilitarian Mechanism Design
SIAM Journal on Computing
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
SIAM Journal on Computing
Daily-deal selection for revenue maximization
Proceedings of the 21st ACM international conference on Information and knowledge management
A fast asymptotic approximation scheme for bin packing with rejection
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Energy-efficient data redistribution in sensor networks
ACM Transactions on Sensor Networks (TOSN)
All-or-Nothing generalized assignment with application to scheduling advertising campaigns
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Faster approximation algorithms for scheduling with fixed jobs
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Faster approximation algorithms for scheduling with fixed jobs
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Hi-index | 0.00 |
The multiple knapsack problem (MKP) is a natural and well-known generalization of the single knapsack problem and is defined as follows. We are given a set of $n$ items and $m$ bins (knapsacks) such that each item $i$ has a profit $p(i)$ and a size $s(i)$, and each bin $j$ has a capacity $c(j)$. The goal is to find a subset of items of maximum profit such that they have a feasible packing in the bins. MKP is a special case of the generalized assignment problem (GAP) where the profit and the size of an item can vary based on the specific bin that it is assigned to. GAP is APX-hard and a 2-approximation, for it is implicit in the work of Shmoys and Tardos [Math. Program. A, 62 (1993), pp. 461-474], and thus far, this was also the best known approximation for MKP\@. The main result of this paper is a polynomial time approximation scheme (PTAS) for MKP\@. Apart from its inherent theoretical interest as a common generalization of the well-studied knapsack and bin packing problems, it appears to be the strongest special case of GAP that is not APX-hard. We substantiate this by showing that slight generalizations of MKP are APX-hard. Thus our results help demarcate the boundary at which instances of GAP become APX-hard. An interesting aspect of our approach is a PTAS-preserving reduction from an arbitrary instance of MKP to an instance with $O(\log n)$ distinct sizes and profits.