A Lower Bound for On-Line Vector-Packing Algorithms

  G. Galambos H. Kellerer G. Wöginger

Abstract:

 In this paper we deal with the vector-packing problem which is a generalization of the well known one-dimensional bin-packing problem to higher dimensions. We give the first, non-trivial lower bounds on the asymptotic worst case ratio of any on-line -dimensional vector packing algorithm.

  Keywords. vector-packing, worst-case analysis, on-line algorithms, lower bounds, competitive algorithms.

 Gyenizse Pal 1996. Szeptember 4. Szerda 13:32:12 MET DST