Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Optimal Scheduling and Placement of Internet Banner Advertisements
IEEE Transactions on Knowledge and Data Engineering
A channel assignment algorithm for multi-radio wireless mesh networks
Computer Communications
IEEE/ACM Transactions on Networking (TON)
Bin completion algorithms for multicontainer packing, knapsack, and covering problems
Journal of Artificial Intelligence Research
Analysis and evaluation of a multiple gateway traffic-distribution scheme for gateway clusters
Computer Communications
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Approximation algorithms for traffic grooming in WDM rings
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
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
Approximation algorithms for scheduling and packing problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
An approximation scheme for the two-stage, two-dimensional knapsack problem
Discrete 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 |
In the {\em multiple subset sum problem} (MSSP) items from a given ground set are selected and packed into a given number of identical bins such that the sum of the item weights in every bin does not exceed the bin capacity and the total sum of the weights of the items packed is as large as possible.This problem is a relevant special case of the multiple knapsack problem, for which the existence of a polynomial-time approximation scheme (PTAS) is an important open question in the field of knapsack problems. One main result of the present paper is the construction of a PTAS for MSSP.For the bottleneck case of the problem, where the minimum total weight contained in any bin is to be maximized, we describe a 2/3-approximation algorithm and show that this is the best possible approximation ratio. Moreover, PTASs are derived for the special cases in which either the number of bins or the number of different item weights is constant.We finally show that, even for the case of only two bins, no fully PTAS exists for both versions of the problem.