On-line packing sequences of segments, cubes and boxes.
Lassak, Marek (1997)
Beiträge zur Algebra und Geometrie
Similarity:
Lassak, Marek (1997)
Beiträge zur Algebra und Geometrie
Similarity:
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.
Kuperberg, Greg (2000)
Geometry & Topology
Similarity:
Schürmann, Achill (2006)
Documenta Mathematica
Similarity:
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.
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. ...
Mukhacheva, È.A., Mukhacheva, A.S. (2004)
Journal of Mathematical Sciences (New York)
Similarity:
Fodor, Ferenc (2000)
Beiträge zur Algebra und Geometrie
Similarity:
Graham, R.L., Lubachevski, B.D. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graham, R.L., Lubachevsky, B.D. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity: