2,482 research outputs found
New bounds for multi-dimensional packing
New upper and lower bounds are presented for a multi-dimensional generalization of bin packing called box packing. Several variants of this problem, including bounded space box packing, square packing, variable sized box packing and resource augmented box packing are also studied. The main results, stated for d=2, are as follows: A new upper bound of 2.66013 for online box packing, a new polynomial time offline approximation algorithm for square packing, a new upper bound of 2.43828 for online square packing, a new lower bound of 1.62176 for online square packing, a new lower bound of 2.28229 for bounded space online square packing and a new upper bound of 2.32571 for online two-sized box packing
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
We prove a tight lower bound on the asymptotic performance ratio of
the bounded space online -hypercube bin packing problem, solving an open
question raised in 2005. In the classic -hypercube bin packing problem, we
are given a sequence of -dimensional hypercubes and we have an unlimited
number of bins, each of which is a -dimensional unit hypercube. The goal is
to pack (orthogonally) the given hypercubes into the minimum possible number of
bins, in such a way that no two hypercubes in the same bin overlap. The bounded
space online -hypercube bin packing problem is a variant of the
-hypercube bin packing problem, in which the hypercubes arrive online and
each one must be packed in an open bin without the knowledge of the next
hypercubes. Moreover, at each moment, only a constant number of open bins are
allowed (whenever a new bin is used, it is considered open, and it remains so
until it is considered closed, in which case, it is not allowed to accept new
hypercubes). Epstein and van Stee [SIAM J. Comput. 35 (2005), no. 2, 431-448]
showed that is and , and conjectured that
it is . We show that is in fact . To
obtain this result, we elaborate on some ideas presented by those authors, and
go one step further showing how to obtain better (offline) packings of certain
special instances for which one knows how many bins any bounded space algorithm
has to use. Our main contribution establishes the existence of such packings,
for large enough , using probabilistic arguments. Such packings also lead to
lower bounds for the prices of anarchy of the selfish -hypercube bin packing
game. We present a lower bound of for the pure price of
anarchy of this game, and we also give a lower bound of for
its strong price of anarchy
Online Bin Covering with Limited Migration
Semi-online models where decisions may be revoked in a limited way have been studied extensively in the last years.
This is motivated by the fact that the pure online model is often too restrictive to model real-world applications, where some changes might be allowed. A well-studied measure of the amount of decisions that can be revoked is the migration factor beta: When an object o of size s(o) arrives, the decisions for objects of total size at most beta * s(o) may be revoked. Usually beta should be a constant. This means that a small object only leads to small changes. This measure has been successfully investigated for different, classical problems such as bin packing or makespan minimization. The dual of makespan minimization - the Santa Claus or machine covering problem - has also been studied, whereas the dual of bin packing - the bin covering problem - has not been looked at from such a perspective.
In this work, we extensively study the bin covering problem with migration in different scenarios. We develop algorithms both for the static case - where only insertions are allowed - and for the dynamic case, where items may also depart. We also develop lower bounds for these scenarios both for amortized migration and for worst-case migration showing that our algorithms have nearly optimal migration factor and asymptotic competitive ratio (up to an arbitrary small epsilon). We therefore resolve the competitiveness of the bin covering problem with migration
Dagstuhl Reports : Volume 1, Issue 2, February 2011
Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro Pezzé, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn
- …