On a covering problem of Mullin and Stanton for binary matroids.
On a Problem About Covering Lines by Squares.
On a problem about covering lines by squares.
On codes with given minimum distance and covering radius.
On codes with given minimum distance and covering radius.
On coset coverings of solutions of homogeneous cubic equations over finite fields.
On covering of bounded sets by sets with the twice less diameter
On homogeneous coverings of Euclidean spaces.
On kissing numbers in dimensions 32 to 128.
On packing spheres into containers.
On random greedy triangle packing.
On the Covering Multiplicity of Lattices.
On the local linear independence of translates of a box spline
On-line Covering the Unit Square with Squares
The unit square can be on-line covered with any sequence of squares whose total area is not smaller than 4.
On-line Packing Squares into n Unit Squares
If n ≥ 3, then any sequence of squares of side lengths not greater than 1 whose total area does not exceed ¼(n+1) can be on-line packed into n unit squares.
Optimisation hybride par colonies de fourmis pour le problème de découpe à deux dimensions
Nous nous intéressons dans cet article au problème de découpe guillotine en deux dimensions noté 2BP/O/G. Il s'agit de découper un certain nombre de pièces rectangulaires dans un ensemble de plaques de matière première, elles même rectangulaires et identiques. Celles-ci sont disponibles en quantité illimitée. L'objectif est de minimiser le nombre de plaques utilisées pour satisfaire la demande, en appliquant une succession de coupes, dites guillotines, allant de bout en bout. Nous proposons une approche...
Orthogonal double covers of complete graphs by fat caterpillars
An orthogonal double cover (ODC) of the complete graph Kₙ by some graph G is a collection of n spanning subgraphs of Kₙ, all isomorphic to G, such that any two of the subgraphs share exactly one edge and every edge of Kₙ is contained in exactly two of the subgraphs. A necessary condition for such an ODC to exist is that G has exactly n-1 edges. We show that for any given positive integer d, almost all caterpillars of diameter d admit an ODC of the corresponding complete graph.