AbstractLet m be an integer ⩾ 2. The effect of crowding m unit vectors x1,…,xm into the real Euclidean space Rn of n dimensions is investigated. In particular, several upper bounds for the quantity mini≠j∥xi − xj∥ are obtained. These are simpler than any previously known and, at least in some cases, almost as sharp. The results have application to the so-called maximum-dispersal (or “misanthrope”) problem, an open problem recently popularized by Klee
noneWhat is the smallest rectangle that can hold squares of sizes 1 to n? This problem is unsolved f...
This paper gives probabilistic analyses of two kinds of multidimensional bin packing problems: vecto...
We study the d-dimensional vector bin packing problem, a well-studied generalization of bin packing ...
AbstractLet m be an integer ⩾ 2. The effect of crowding m unit vectors x1,…,xm into the real Euclide...
AbstractFor integral̋ m⩾2, let x1,…, xm be any unit vectors in Rn, the real Euclidean space of n dim...
We study an extension of the well-known bin-packing problem to multiple dimensions, resulting in the...
A rectangular storage area orbin, of widthwand heighth, stores nonoverlapping square objects, of siz...
This document is composed of a series of articles in discrete geometry, each solving a problem in pa...
AbstractA Minkowski space Md=(Rd, ‖‖) is just Rd with distances measured using a norm ‖‖. A norm ‖‖ ...
In the d-dimensional bin packing problem (VBP), one is given vectors x1, x2,..., xn ∈ Rd and the goa...
We consider the following three-dimensional packing problem that arises in multibody motion planning...
In this paper, we address the 2-dimensional vector packing problem where an optimal layout for a se...
Suppose a1, . . . an an are vectors of length at least 1 in m-dimensional real space, not necessaril...
Abstract. In this paper we prove a theorem that provides an upper bound for the density of packings ...
We consider a symmetric random walk of length n that starts at the origin and takes steps uniformly ...
noneWhat is the smallest rectangle that can hold squares of sizes 1 to n? This problem is unsolved f...
This paper gives probabilistic analyses of two kinds of multidimensional bin packing problems: vecto...
We study the d-dimensional vector bin packing problem, a well-studied generalization of bin packing ...
AbstractLet m be an integer ⩾ 2. The effect of crowding m unit vectors x1,…,xm into the real Euclide...
AbstractFor integral̋ m⩾2, let x1,…, xm be any unit vectors in Rn, the real Euclidean space of n dim...
We study an extension of the well-known bin-packing problem to multiple dimensions, resulting in the...
A rectangular storage area orbin, of widthwand heighth, stores nonoverlapping square objects, of siz...
This document is composed of a series of articles in discrete geometry, each solving a problem in pa...
AbstractA Minkowski space Md=(Rd, ‖‖) is just Rd with distances measured using a norm ‖‖. A norm ‖‖ ...
In the d-dimensional bin packing problem (VBP), one is given vectors x1, x2,..., xn ∈ Rd and the goa...
We consider the following three-dimensional packing problem that arises in multibody motion planning...
In this paper, we address the 2-dimensional vector packing problem where an optimal layout for a se...
Suppose a1, . . . an an are vectors of length at least 1 in m-dimensional real space, not necessaril...
Abstract. In this paper we prove a theorem that provides an upper bound for the density of packings ...
We consider a symmetric random walk of length n that starts at the origin and takes steps uniformly ...
noneWhat is the smallest rectangle that can hold squares of sizes 1 to n? This problem is unsolved f...
This paper gives probabilistic analyses of two kinds of multidimensional bin packing problems: vecto...
We study the d-dimensional vector bin packing problem, a well-studied generalization of bin packing ...