360 search results - page 3 / 72 » The TV-Break Packing Problem |
EOR
2002
13 years 5 months ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
ESA
1993
Springer
13 years 9 months ago
1993
Springer
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
ESA
2005
Springer
13 years 11 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
ISAAC
2009
Springer
13 years 10 months ago
2009
Springer
An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph between any two odd cycles in the packing. We prove that the problem is solvable in t...