Deep performance analysis of refined harmonic bin packing algorithm

Authors:
Gu Xiaodong;Chen Guoliang;Xu Yinlong
Affiliations:
National High Performance Computing Center at Hefei, Department of Computer Science and Technology University of Science and Technology of China, Hefei 230027, P.R. China;National High Performance Computing Center at Hefei, Department of Computer Science and Technology University of Science and Technology of China, Hefei 230027, P.R. China;National High Performance Computing Center at Hefei, Department of Computer Science and Technology University of Science and Technology of China, Hefei 230027, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2002

Citing 5
Cited 0

A simple on-line bin-packing algorithm

Journal of the ACM (JACM)
Bounded space on-line bin packing: best is better than first

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
On the sum-of-squares algorithm for bin packing

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

Refined Harmonic (RH) is one of the best on-line bin packing algorithms. The algorithm was first proposed by Lee&Lee in 1985 and the upper bound of the worst-case performance ratio has been proved to be 1.63596..., In this paper, it is proved that 1.63596... is also the lower bound. The average performance of RH is also studied for the first time. It is shown that the average-case performance ratio of RH is 1.28243... under the uniform distribution.