 
Summary: CS 663: Pattern Matching Algorithms
Scribe: Chen Jiang 11/29/2010
PTAS for BinPacking
1. Introduction
The BinPacking problem is NPhard. If we use approximation algorithms, the BinPacking
problem could be solved in polynomial time. For example, the simplest approximation algorithm
is the Firstfit algorithm, which solves the BinPacking problem in time )log( nnO .
We use the approximation factor to determine how good our approximation algorithm is.
Let )(IA be the number of bins required by the approximation algorithm, and let )(IOPT be
the optimal number of required bins for input I. We say that algorithm A has approximation factor
C if for every input I:
)1()()( CIOPTCIA
This inequality means that the approximation algorithm would not use more than C times the
optimal number of bins, which is also the upper bound of the approximation algorithm.
Obviously, the closer C is to 1, the better the approximation.
Claim: The BinPacking problem has a PTAS (Polynomial Time Approximation Scheme).
I.e., Given 0> , one can always produce approximation algorithm whose (1) time is
polynomial in n and ; and (2) whose approximation factor is,
)()1()( IOPTIA +
2. Special Cases for BinPacking
