Displaying similar documents to “On-line packing sequences of segments, cubes and boxes.”

Packing of non-blocking four-dimensional cubes into the unit cube

Janusz Januszewski, Łukasz Zielonka (2024)

Archivum Mathematicum

Similarity:

Any collection of non-blocking four-dimensional cubes, whose total volume does not exceed 17/81, can be packed into the unit four-dimensional cube. This bound is tight for the parallel packing.

Packing Parameters in Graphs

I. Sahul Hamid, S. Saravanakumar (2015)

Discussiones Mathematicae Graph Theory

Similarity:

In a graph G = (V,E), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. An open packing set which is not a proper subset of any open packing set is called a maximal open packing set. The minimum and maximum cardinalities of a maximal open packing set are respectively called the lower open packing number and the open packing number and are denoted by ρoL and ρo. In this paper, we present some bounds on these parameters. ...

Universal container for packing rectangles

Janusz Januszewski (2002)

Colloquium Mathematicae

Similarity:

The aim of the paper is to find a rectangle with the least area into which each sequence of rectangles of sides not greater than 1 with total area 1 can be packed.

On-line packing regular boxes in the unit cube

Janusz Januszewski (1999)

Archivum Mathematicum

Similarity:

We describe a class of boxes such that every sequence of boxes from this class of total volume smaller than or equal to 1 can be on-line packed in the unit cube.