A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem

In this thesis, we deal with two packing problems: the online bin packing and the geometric knapsack problem. In online bin packing, the aim is to pack a given number of items of different size into a minimal number of containers. The items need to be packed one by one without knowing future items. For online bin packing in one dimension, we present a new family of algorithms that constitutes the first improvement over the previously best algorithm in almost 15 years. While the algorithmic ideas are intuitive, an elaborate analysis is required to prove its competitive ratio. We also give a lower bound for the competitive ratio of this family of algorithms. For online bin packing in higher dimensions, we discuss lower bounds for the competitive ratio and show that the ideas from the one-dimensional case cannot be easily transferred to obtain better two-dimensional algorithms. In the geometric knapsack problem, one aims to pack a maximum weight subset of given rectangles into one square container. For this problem, we consider online approximation algorithms. For geometric knapsack with square items, we improve the running time of the best known PTAS and obtain an EPTAS. This shows that large running times caused by some standard techniques for geometric packing problems are not always necessary and can be improved. Finally, we show how to use resource augmentation to compute optimal solutions in EPTAS-time, thereby improving upon the known PTAS for this case.In dieser Arbeit betrachten wir zwei Packungsprobleme: Online Bin Packing und das geometrische Rucksackproblem. Bei Online Bin Packing versucht man, eine gegebene Menge an Objekten verschiedener Größe in die kleinstmögliche Anzahl an Behältern zu packen. Die Objekte müssen eins nach dem anderen gepackt werden, ohne zukünftige Objekte zu kennen. Für eindimensionales Online Bin Packing beschreiben wir einen neuen Algorithmus, der die erste Verbesserung gegenüber dem bisher besten Algorithmus seit fast 15 Jahren darstellt. Während die algorithmischen Ideen intuitiv sind, ist eine ausgefeilte Analyse notwendig um das Kompetitivitätsverhältnis zu beweisen. Für Online Bin Packing in mehreren Dimensionen geben wir untere Schranken für das Kompetitivitätsverhältnis an und zeigen, dass die Ideen aus dem eindimensionalen Fall nicht direkt zu einer Verbesserung führen. Beim geometrischen Rucksackproblem ist es das Ziel, eine größtmögliche Teilmenge gegebener Rechtecke in einen einzelnen quadratischen Behälter zu packen. Für dieses Problem betrachten wir Approximationsalgorithmen. Für das Problem mit quadratischen Objekten verbessern wir die Laufzeit des bekannten PTAS zu einem EPTAS. Die langen Laufzeiten vieler Standardtechniken für geometrische Probleme können also vermieden werden. Schließlich zeigen wir, wie Ressourcenvergrößerung genutzt werden kann, um eine optimale Lösung in EPTAS-Zeit zu berechnen, was das bisherige PTAS verbessert.Google PhD Fellowshi

Hyperuniformity, quasi-long-range correlations, and void-space constraints in maximally random jammed particle packings. I. Polydisperse spheres

Hyperuniform many-particle distributions possess a local number variance that grows more slowly than the volume of an observation window, implying that the local density is effectively homogeneous beyond a few characteristic length scales. Previous work on maximally random strictly jammed sphere packings in three dimensions has shown that these systems are hyperuniform and possess unusual quasi-long-range pair correlations, resulting in anomalous logarithmic growth in the number variance. However, recent work on maximally random jammed sphere packings with a size distribution has suggested that such quasi-long-range correlations and hyperuniformity are not universal among jammed hard-particle systems. In this paper we show that such systems are indeed hyperuniform with signature quasi-long-range correlations by characterizing the more general local-volume-fraction fluctuations. We argue that the regularity of the void space induced by the constraints of saturation and strict jamming overcomes the local inhomogeneity of the disk centers to induce hyperuniformity in the medium with a linear small-wavenumber nonanalytic behavior in the spectral density, resulting in quasi-long-range spatial correlations. A numerical and analytical analysis of the pore-size distribution for a binary MRJ system in addition to a local characterization of the n-particle loops governing the void space surrounding the inclusions is presented in support of our argument. This paper is the first part of a series of two papers considering the relationships among hyperuniformity, jamming, and regularity of the void space in hard-particle packings.Comment: 40 pages, 15 figure

Random packing of regular polygons and star polygons on a flat two-dimensional surface

Random packing of unoriented regular polygons and star polygons on a two-dimensional flat, continuous surface is studied numerically using random sequential adsorption algorithm. Obtained results are analyzed to determine saturated random packing ratio as well as its density autocorrelation function. Additionally, the kinetics of packing growth and available surface function are measured. In general, stars give lower packing ratios than polygons, but, when the number of vertexes is large enough, both shapes approach disks and, therefore, properties of their packing reproduce already known results for disks.Comment: 5 pages, 8 figure

Soft grain compression: beyond the jamming point

We present the experimental studies of highly strained soft bidisperse granular systems made of hyperelastic and plastic particles. We explore the behavior of granular matter deep in the jammed state from local field measurement from the grain scale to the global scale. By mean of digital image correlation and accurate image recording we measure for each compression step the evolution of the particle geometries and their right Cauchy-Green strain tensor fields. We analyze the evolution of the usual macroscopic observables (stress, packing fraction, coordination, fraction of non-rattlers, \textit{etc}.) along the compression process through the jamming point and far beyond. We also analyze the evolution of the local strain statistics and evidence a crossover in the material behavior deep in the jammed state. We show that this crossover depends on the particle material. We argue that the strain field is a reliable observable to describe the evolution of a granular system through the jamming transition and deep in the dense packing state whatever is the material behavior.Comment: 10 figure

Lower bounds for several online variants of bin packing

We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.Comment: WAOA 201

An Efficient Data Structure for Dynamic Two-Dimensional Reconfiguration

In the presence of dynamic insertions and deletions into a partially reconfigurable FPGA, fragmentation is unavoidable. This poses the challenge of developing efficient approaches to dynamic defragmentation and reallocation. One key aspect is to develop efficient algorithms and data structures that exploit the two-dimensional geometry of a chip, instead of just one. We propose a new method for this task, based on the fractal structure of a quadtree, which allows dynamic segmentation of the chip area, along with dynamically adjusting the necessary communication infrastructure. We describe a number of algorithmic aspects, and present different solutions. We also provide a number of basic simulations that indicate that the theoretical worst-case bound may be pessimistic.Comment: 11 pages, 12 figures; full version of extended abstract that appeared in ARCS 201