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

We consider the following problem: The Santa Claus has n presents that he wants to
distribute among m kids. Each kid has an arbitrary value for each present. Let pij be the …

We discuss scheduling problems with m identical machines and n jobs where each job has
to be assigned to some machine. The goal is to optimize objective functions that solely …

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) …

1 Her work has been supported in part by an NRW grant for gender-sensitive universities
supporting her as a junior professor for Computational Social Choice and by the project …

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 …

We consider allocating indivisible chores among agents with different cost functions, such
that all agents receive a cost of at most a constant factor times their maximin share. The state …

Multiagent resource allocation provides mechanisms to allocate bundles of resources to
agents, where resources are assumed to be indivisible and nonshareable. A central goal is …

We give a polynomial approximation scheme for the problem of scheduling on uniformly
related parallel machines for a large class of objective functions that depend only on the …

Internal measures that are used to assess the quality of a clustering usually take into
account intra-group and/or inter-group criteria. There are many papers in the literature that …