The bin packing problem is a well-studied problem in combinatorial optimization. In the
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …

This chapter deals with a couple of problems that are all related to the classical bin packing
problem. In this problem, one is given a list L of items (al, a2,..., a,~), each item a~ E (0, 1] …

This paper updates a survey [53J written about 3 years ago. All of the results mentioned
there are covered here as well. However, as a major justification for this second edition we …

N COMPUTER applications we are used to live with approximation. Var I ious notions of
approximation appear, in fact, in many circumstances. One notable example is the type of …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

We study the approximability of multidimensional generalizations of three classical packing
problems: multiprocessor scheduling, bin packing, and the knapsack problem. Specifically …

In the classical bin packing problem one seeks to pack a list of pieces in the minimum space
using unit capacity bins. This paper addresses the more general problem in which a fixed …

FlexRay is a communication protocol heavily promoted on the market by a large group of car
manufacturers and automotive electronics suppliers. However, before it can be successfully …

We consider the problem of assigning a set of n jobs to a system of m identical parallel
machines so as to maximize the earliest machine completion time (without using idle times) …

Crowdsourcing allows requesters to allocate tasks to a group of workers on the Internet to
make use of their collective intelligence. Quality control is a key design objective in incentive …