A linear approximation algorithm for the BPP with the best possible absolute approximation ratio
Zehmakan, Abdolahad N.
- Working Paper
The Bin Packing Problem is one of the most important Combinatorial Optimization problems in optimization and has a lot of real-world applications. Many approximation algorithms have been presented for this problem because of its NP-hard nature. In this article also a new creative approximation algorithm is presented for this important problem. It has been proven that the best approximation ratio and the best time order for the Bin Packing Problem are 3/2 and O(n), respectively unless P=NP. The presented algorithm in this article has the best possible factors, O(n) and 3/2 Show more
Journal / seriesarXiv
Pages / Article No.
Organisational unit03457 - Welzl, Emo / Welzl, Emo
MoreShow all metadata