Name
Abstract | ||
|---|---|---|
The covering and packing of a unit square (resp. cube) with squares (resp. cubes) are considered. In d-dimensional Euclidean space E-d, the size of a d-hypercube is given by its side length and the size of a covering is the total size of the d-hypercubes used to cover the unit hypercube. Denote by g(d)(n) the smallest size of a minimal covering (which consisting of n hypercubes) of a d-dimensional unit hypercube. In this paper we consider the problem of covering a unit hypercube with hypercubes in E-d for d >= 4 and determine the tight upper bound and lower bound for gd(n). |
Year | Venue | Keywords |
|---|---|---|
2016 | ARS COMBINATORIA | Covering,d-dimensional hypercube |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Mathematics,Hypercube | Journal | 126 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chunxia Shen | 1 | 0 | 0.34 |
| Zhanjun Su | 2 | 1 | 1.83 |
| Liping Yuan | 3 | 0 | 0.68 |