Abstract For every fixed graph H, we determine the H-packing number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, P (H, Kn) = b 2h b n − 1 d cc, unless n = 1 mod d and n(n − 1)/d = b mod (2h/d) where 1 ≤ b ≤ d, in which case P (H, Kn) = b 2h b n ...

We continue the study of two recently introduced bin packing type problems, called with clustering, and online delays. A input consists items sizes not larger than 1, goal is to partition or pack them into bins, where total size every valid cannotexceed 1. In also have colors associated them. globally optimal solution can combine different while a clustered only monochromatic bins. The compare ...