Approximation Algorithms for Scheduling and Packing Problems

Abstract

In this paper we present an overview about new approximation results for several optimization problems. During the last years we have worked on the design of approximation algorithms with a smaller approximation ratio and on the design of efficient polynomial time approximation schemes with a faster running time. We presented approximation algorithms with a smaller ratio for scheduling with fixed jobs and for two dimensional strip packing. On the other hand, we developed efficient approximation schemes with an improved running time for multiple knapsack and scheduling independent jobs on uniform processors.