Sciweavers

956 search results - page 5 / 192
» Packing Patterns into Words
Sort
View
CMA
2011
12 years 11 months ago
On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
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...
Aline Castro, Sandi Klavzar, Michel Mollard, Yoomi...
ISAAC
2005
Springer
97views Algorithms» more  ISAAC 2005»
14 years 29 days ago
A Min-Max Relation on Packing Feedback Vertex Sets
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 ...
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
4OR
2008
79views more  4OR 2008»
13 years 7 months ago
MIP-based heuristic for non-standard 3D-packing problems
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 ...
Giorgio Fasano
4OR
2004
90views more  4OR 2004»
13 years 7 months ago
A MIP approach for some practical packing problems: Balancing constraints and tetris-like items
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...
Giorgio Fasano
ALGORITHMICA
2004
125views more  ALGORITHMICA 2004»
13 years 7 months ago
Multidimensional Cube Packing
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...
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa...