Published July 30, 2015
| Version v1
Journal article
Open
BIN PACKING PROBLEM: TWO APPROXIMATION ALGORITHMS
Authors/Creators
Description
The Bin Packing Problem is one of the most important optimization problems. In recent years, due to its NP-hard nature, several approximation algorithms have been presented. It is proved that the best algorithm for the Bin Packing Problem has the approximation ratio 3/2 and the time orderO(n), unlessP=NP. In this paper, first, a -approximation algorithm is presented, then a modification to FFD algorithm is proposed to decrease time order to linear.