Improved online hypercube packing

Details Improved online hypercube packing Improved online hypercube packing

2006-07-11

arxiv.org/abs/cs/0607045v2

Computer Science

Data Structures and Algorithms

13 pages, one figure, accepted in WAOA'06

Scientific paper

In this paper, we study online multidimensional bin packing problem when all items are hypercubes. Based on the techniques in one dimensional bin packing algorithm Super Harmonic by Seiden, we give a framework for online hypercube packing problem and obtain new upper bounds of asymptotic competitive ratios. For square packing, we get an upper bound of 2.1439, which is better than 2.24437. For cube packing, we also give a new upper bound 2.6852 which is better than 2.9421 by Epstein and van Stee.

Affiliated with

Also associated with

No associations

Rating

Improved online hypercube packing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved online hypercube packing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved online hypercube packing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138052