4,136 research outputs found
A list version of graph packing
We consider the following generalization of graph packing. Let and be graphs of order and a bipartite graph. A bijection from
onto is a list packing of the triple if implies and for all . We extend the classical results of Sauer and Spencer and Bollob\'{a}s
and Eldridge on packing of graphs with small sizes or maximum degrees to the
setting of list packing. In particular, we extend the well-known
Bollob\'{a}s--Eldridge Theorem, proving that if , and , then either packs or is one of 7 possible
exceptions. Hopefully, the concept of list packing will help to solve some
problems on ordinary graph packing, as the concept of list coloring did for
ordinary coloring.Comment: 10 pages, 4 figure
Bin Packing and Related Problems: General Arc-flow Formulation with Graph Compression
We present an exact method, based on an arc-flow formulation with side
constraints, for solving bin packing and cutting stock problems --- including
multi-constraint variants --- by simply representing all the patterns in a very
compact graph. Our method includes a graph compression algorithm that usually
reduces the size of the underlying graph substantially without weakening the
model. As opposed to our method, which provides strong models, conventional
models are usually highly symmetric and provide very weak lower bounds.
Our formulation is equivalent to Gilmore and Gomory's, thus providing a very
strong linear relaxation. However, instead of using column-generation in an
iterative process, the method constructs a graph, where paths from the source
to the target node represent every valid packing pattern.
The same method, without any problem-specific parameterization, was used to
solve a large variety of instances from several different cutting and packing
problems. In this paper, we deal with vector packing, graph coloring, bin
packing, cutting stock, cardinality constrained bin packing, cutting stock with
cutting knife limitation, cutting stock with binary patterns, bin packing with
conflicts, and cutting stock with binary patterns and forbidden pairs. We
report computational results obtained with many benchmark test data sets, all
of them showing a large advantage of this formulation with respect to the
traditional ones
An Ore-type theorem for perfect packings in graphs
We say that a graph G has a perfect H-packing (also called an H-factor) if
there exists a set of disjoint copies of H in G which together cover all the
vertices of G. Given a graph H, we determine, asymptotically, the Ore-type
degree condition which ensures that a graph G has a perfect H-packing. More
precisely, let \delta_{\rm Ore} (H,n) be the smallest number k such that every
graph G whose order n is divisible by |H| and with d(x)+d(y)\geq k for all
non-adjacent x \not = y \in V(G) contains a perfect H-packing. We determine
\lim_{n\to \infty} \delta_{\rm Ore} (H,n)/n.Comment: 23 pages, 1 figure. Extra examples and a sketch proof of Theorem 4
added. To appear in the SIAM Journal on Discrete Mathematic
Upper bounds for packings of spheres of several radii
We give theorems that can be used to upper bound the densities of packings of
different spherical caps in the unit sphere and of translates of different
convex bodies in Euclidean space. These theorems extend the linear programming
bounds for packings of spherical caps and of convex bodies through the use of
semidefinite programming. We perform explicit computations, obtaining new
bounds for packings of spherical caps of two different sizes and for binary
sphere packings. We also slightly improve bounds for the classical problem of
packing identical spheres.Comment: 31 page
- …