✦ LIBER ✦

Multidimensional Cube Packing

✍ Scribed by Yoshiharu Kohayakawa; Flavio Keidi Miyazawa; Prabhakar Raghavan; Yoshiko Wakabayashi

Publisher: Springer
Year: 2004
Tongue: English
Weight: 231 KB
Volume: 40
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-004-1102-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Y. Kohayakawa; F.K. Miyazawa; P. Raghavan; Y. Wakabayashi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 280 KB

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

Online square and cube packing

✍ Leah Epstein; Rob van Stee 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 261 KB

Parallel searching of multidimensional c

Parallel searching of multidimensional cubes

✍ Miklos Santha; Umesh V. Vazirani 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 601 KB

Random packings by cubes

✍ Alexey P. Poyarkov 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 110 KB

Covering and Packing Problems in Lattice

Covering and Packing Problems in Lattices Associated with then-Cube

✍ Horst Martini; Walter Wenzel 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 145 KB

We study optimal coverings of lattices associated with a given n-cube by frames (= Hamming spheres of radius one) and extended frames under certain constraints, e.g., by constituting at the same time packings of the edge system in such finite lattices. These investigations also yield results on diff