Related papers: A Note On the Size of Largest Bins Using Placement…
The sliding cubes model is a well-established theoretical framework that supports the analysis of reconfiguration algorithms for modular robots consisting of face-connected cubes. The best algorithm currently known for the reconfiguration…
A finite point set in $\mathbb{R}^d$ is in general position if no $d + 1$ points lie on a common hyperplane. Let $\alpha_d(N)$ be the largest integer such that any set of $N$ points in $\mathbb{R}^d$, with no $d + 2$ members on a common…
We consider the problem of finding $A_2(n,\{d_1,d_2\})$ defined as the maximal size of a binary (non-linear) code of length $n$ with two distances $d_1$ and $d_2$. Binary codes with distances $d$ and $d+2$ of size…
The list-labeling problem captures the basic task of storing a dynamically changing set of up to $n$ elements in sorted order in an array of size $m = (1 + \Theta(1))n$. The goal is to support insertions and deletions while moving around…
We consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…
Given a collection $\mathcal L$ of $n$ points on a sphere $\mathbf{S}^2_n$ of surface area $n$, a fair allocation is a partition of the sphere into $n$ parts each of area $1$, and each associated with a distinct point of $\mathcal L$. We…
The problem of bounding of the distance between the two bodies of volume $\varepsilon$ located inside the $n$-dimensional body $B$ of unit volume where $n \to \infty$ is considered. In some cases such distances are bounded by function…
The Bin Packing Problem (BPP) has attracted enthusiastic research interest recently, owing to widespread applications in logistics and warehousing environments. It is truly essential to optimize the bin packing to enable more objects to be…
Imagine that there are two bins to which balls are added sequentially, and each incoming ball joins a bin with probability proportional to the p-th power of the number of balls already there. A general result says that if p>1/2, there…
Binary embedding is the problem of mapping points from a high-dimensional space to a Hamming cube in lower dimension while preserving pairwise distances. An efficient way to accomplish this is to make use of fast embedding techniques…
In this article, we consider the problems of finding in $d+1$ dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex body into which a given set of $d$-dimensional unit-radius…
The sphere packing problem asks for the greatest density of a packing of congruent balls in Euclidean space. The current best upper bound in all sufficiently high dimensions is due to Kabatiansky and Levenshtein in 1978. We revisit their…
We analyze the asymptotic properties of a Euclidean optimization problem on the plane. Specifically, we consider a network with three bins and $n$ objects spatially uniformly distributed, each object being allocated to a bin at a cost…
Motivated by automated junction recognition in tracking data, we study a problem of placing a square or disc of fixed size in an arrangement of lines or line segments in the plane. We let distances among the intersection points of the lines…
We consider a deposition model in which balls rain down at random towards a 2-dimensional surface, roll downwards over existing adsorbed balls, are adsorbed if they reach the surface, and discarded if not. We prove a spatial law of large…
In this paper, we propose a class of elementary plane geometry problems closely related to the title of this paper. Here, a circle is the 1-dimensional curve bounding a disk. For any nonnegative integer, a circle is called $n$-enclosing if…
Given a set of n disjoint balls b1, . . ., bn in IRd, we provide a data structure, of near linear size, that can answer (1 \pm \epsilon)-approximate kth-nearest neighbor queries in O(log n + 1/\epsilon^d) time, where k and \epsilon are…
Let $A_2(n,d)$ be the maximum size of a binary code of length $n$ and minimum distance $d$. In this paper we present the following new lower bounds: $A_2(18,4) \ge 5632$, $A_2(21,4) \ge 40960$, $A_2(22,4) \ge 81920$, $A_2(23,4) \ge 163840$,…
We study the problem of ordered stabbing of $n$ balls (of arbitrary and possibly different radii, no ball contained in another) in $\mathbb{R}^d$, $d \geq 3$, with either a directed line segment or a (directed) polygonal curve. Here, the…
Codes over trees were introduced recently to bridge graph theory and coding theory with diverse applications in computer science and beyond. A central challenge lies in determining the maximum number of labelled trees over $n$ nodes with…