𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random packings by cubes

✍ Scribed by Alexey P. Poyarkov


Publisher
Springer US
Year
2007
Tongue
English
Weight
110 KB
Volume
146
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Cube packing
✍ F.K. Miyazawa; Y. Wakabayashi πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 138 KB

The Cube Packing Problem (CPP) is deΓΏned as follows. Find a packing of a given list of (small) cubes into a minimum number of (larger) identical cubes. We show ΓΏrst that the approach introduced by Coppersmith and Raghavan for general on-line algorithms for packing problems leads to an on-line algori

Multidimensional Cube Packing
✍ Y. Kohayakawa; F.K. Miyazawa; P. Raghavan; Y. Wakabayashi πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 280 KB
Multidimensional Cube Packing
✍ Yoshiharu Kohayakawa; Flavio Keidi Miyazawa; Prabhakar Raghavan; Yoshiko Wakabay πŸ“‚ Article πŸ“… 2004 πŸ› Springer 🌐 English βš– 231 KB
Intersecting random half cubes
✍ Michel Talagrand πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 139 KB

We provide the discrete cube Q N = -1 1 N with its uniform probability, and we consider an independent sequence ΞΎ 1 ΞΎ N uniformly distributed on Q N . Kim and Roche recently proved that there exists Ξ΅ > 0 such that the probability that there exists (resp. does not exist) a point x of Q N with ΞΎ k β€’

Covering Cubes by Random Half Cubes, wit
✍ Jeong Han Kim; James R. Roche πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 650 KB

Let Q n be the (hyper)cube [&1, 1] n . This paper is concerned with the following question: How many vectors must be chosen uniformly and independently at random from Q n before every vector in Q n itself has negative inner product with at least one of the random vectors? For any fixed =>0, a simple

Random packings of graphs
✍ Lowell W. Beineke; Peter Hamburger; Wayne D. Goddard πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 612 KB