Related papers: The disc random packing problem: a disorder criter…
The nature of randomness in disordered packings of frictional and frictionless spheres is investigated using theory and simulations of identical spherical grains. The entropy of the packings is defined through the force and volume ensemble…
We push the limit in planning collision-free motions for routing uniform labeled discs in two dimensions. First, from a theoretical perspective, we show that the constant-factor time-optimal routing of labeled discs can be achieved using a…
We study the discrete bin covering problem where a multiset of items from a fixed set $S \subseteq (0,1]$ must be split into disjoint subsets while maximizing the number of subsets whose contents sum to at least $1$. We study the online…
Best-Fit is one of the most prominent and practically used algorithms for the bin packing problem, where a set of items with associated sizes needs to be packed in the minimum number of unit-capacity bins. Kenyon [SODA '96] studied online…
In our paper we consider the Cell Formation Problem in Group Technology with grouping efficiency as an objective function. We present a heuristic approach for obtaining high-quality solutions of the CFP. The suggested heuristic applies an…
Dependence of structural self-organization of granular materials on preparation and grain parameters is key to predictive modelling. We study 60 different mechanically equilibrated polydisperse disc packs, generated numerically by two…
Packings of identical objects have fascinated both scientists and laymen alike for centuries, in particular the sphere packings and the packings of identical regular tetrahedra. Mathematicians have tried for centuries to determine the…
Hyperuniformity characterizes a state of matter that is poised at a critical point at which density or volume-fraction fluctuations are anomalously suppressed at infinite wavelengths. Recently, much attention has been given to the link…
We introduce a new framework term coding for extremal problems in discrete mathematics and information flow, where one chooses interpretations of function symbols so as to maximise the number of satisfying assignments of a finite system of…
The robust multi-product pricing problem is to determine the prices of a collection of products so as to maximize the worst-case revenue, where the worst case is taken over an uncertainty set of demand models that the firm expects could be…
The problem of covering random points in a plane with sets of a given shape has several practical applications in communications and operations research. One especially prominent application is the coverage of randomly-located points of…
The density classification problem is the computational problem of finding the majority in a given array of votes in a distributed fashion. It is known that no cellular automaton rule with binary alphabet can solve the density…
We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…
We investigate the problem of scanning and prediction ("scandiction", for short) of multidimensional data arrays. This problem arises in several aspects of image and video processing, such as predictive coding, for example, where an image…
We present the first systematic algorithm to estimate the maximum packing density of spheres when the grain sizes are drawn from an arbitrary size distribution. With an Apollonian filling rule, we implement our technique for disks in 2d and…
This article describes a model and an exact solution method for facility location problems with decision-dependent uncertainties. The model allows characterizing the probability distribution of the random elements as a function of the…
Discovering causal relations from observational data becomes possible with additional assumptions such as considering the functional relations to be constrained as nonlinear with additive noise (ANM). Even with strong assumptions, causal…
In this paper, the binary random packing fraction of similar particles with size ratios ranging from unity to well over 2 is studied. The classic excluded volume model for spherocylinders and cylinders proposed by Onsager [1] is revisited…
For clustering of an undirected graph, this paper presents an exact algorithm for the maximization of modularity density, a more complicated criterion to overcome drawbacks of the well-known modularity. The problem can be interpreted as the…
This article aims to introduce the paradigm of distributional robustness from the field of convex optimization to tackle optimal design problems under uncertainty. We consider realistic situations where the physical model, and thereby the…