956 search results - page 5 / 192 » Packing Patterns into Words |
140
click to vote
CMA
2011
14 years 3 months ago
2011
Let Γn and Λn be the n-dimensional Fibonacci cube and Lucas cube, respectively. The domination number γ of Fibonacci cubes and Lucas cubes is studied. In particular it is prove...
105
click to vote
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
4OR
2008
15 years 9 hour ago
2008
This paper is the continuation of a previous work (Fasano 2004), dedicated to a MIP formulation for non-standard three-dimensional packing issues, with additional conditions. The ...
100
click to vote
4OR
2004
14 years 11 months ago
2004
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...
ALGORITHMICA
2004
14 years 11 months ago
2004
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...