On-line Variable Sized Covering

We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item sizes. For every finite set of bins B, and upper bound 1=m on the size of items for some integer m, we defie a ratio r(B; m). We prove this is the best possible competitive ratio for the set of bins B and the parameter m, by giving both an algorithm with competitive ratio r(B; m), and an upper bound of r(B; m) on the competitive ratio of any on-line deterministic or randomized algorithm. The ratio satisfies r(B; m) m=(m + 1), and equals this number if all bins are of size 1. For multi-dimensional vector covering we consider the case where each bin is a binary d-dimensional vector. It is known that if B contains a single bin which is all 1, then the best competitive ratio is (1=d). We show an upper bound of 1=2 d(1 o(1)) for the general problem, and consider four special case variants. We show an algorithm with optimal competitive ratio 1=2 for the model where each bin in B is a unit vector. We consider the model where B consists of all unit prefix vectors. Each bin has i leftmost components of 1, and all other components are 0. We show that this model is harder than the case of unit vector bins, by giving an upper bound of O(1= log d) on the competitive ratio of any deterministic or randomized algorithm. Next, we discuss the model where B contains all binary vectors. We show this model is easier than the model of one bin type which is all 1, by giving an algorithm of ratio (1= log d). The most interesting multi-dimensional case is d = 2. Previous results give a 0:25-competitive algorithm for B = f(1; 1)g, and an upper bound of 0:4 on the competitive ratio of any al..