Abstract
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 define 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 T(1/d). We show an upper bound of 1/2d(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 O(1/log d).
The most interesting multi-dimensional case is d = 2. Previous results give a 0.25-competitive algorithm for B = (1,1), and an upper bound of 0.4 on the competitive ratio of any algorithm. In this paper we consider all other models for d = 2. For unit vectors, we give an optimal algorithm with competitive ratio 1/2. For unit prefix vectors we give an upper bound of 4/9 on the competitive ratio of any deterministic or randomized algorithm. For the model where B consists of all binary vectors, we design an algorithm with ratio larger than 0.4. These results show that all above relations between models hold for d = 2 as well.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Alon, Y. Azar, J. Csirik, L. Epstein, S.V. Sevastianov, A.P.A. Vestjens, and G.J. Woeginger On-line and off-line approximation algorithms for vector covering problems. Algorithmica, 21:104–118, 1998.
S.F. Assmann Problems in discrete applied mathematics. Technical report, Doctoral Dissertation, Mathematics Department, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1983.
S.F. Assmann, D.S. Johnson, D.J. Kleitman, and J.Y.-T. Leung On a dual version of the one-dimensional bin packing problem. J. Algorithms, 5:502–525, 1984.
A. Borodin and R. El-Yaniv On randomization in online computations. In Computational Complexity, 1997.
A. Borodin and R. El-Yaniv Online Computation and Competitive Analysis. Cambridge University Press, 1998.
J. Csirik and J.B.G. Frenk A dual version of bin packing. Algorithms Review, 1:87–95, 1990.
J. Csirik, J.B.G. Frenk, G. Galambos, and A.H.G. Rinnooy Kan Probabilistic analysis of algorithms for dual bin packing problems. J. Algorithms, 12:189–203, 1991.
J. Csirik and V. Totik On-line algorithms for a dual version of bin packing. Discr. Appl. Math., 21:163–167, 1988.
J. Csirik and G.J. Woeginger On-line packing and covering problems. In A. Fiat and G.J. Woeginger, editors, Online Algorithms: The State of the Art, volume 1442 of LNCS, pages 154–177. Springer-Verlag, 1998.
T. Gaizer An algorithm for the 2d dual bin packing problem. Unpublished manuscript, University of Szeged, Hungary, 1989.
Gerhard J. Woeginger and Guochuan Zhang Optimal on-line algorithms for variable-sized bin covering. Operations Research Letters, 25:47–50, 1999.
A.C.C. Yao Probabilistic computations: Towards a unified measure of complexity. In Proceedings of the 18th ACM Symposium on Theory of Computing, pages 222–227, 1977.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Epstein, L. (2001). On-Line Variable Sized Covering. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_52
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive