3 search results - page 1 / 1 » Vector Bin Packing with Multiple-Choice |
SWAT
2010
Springer
14 years 3 months ago
2010
Springer
FOCS
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
MFCS
2005
Springer
14 years 4 months ago
2005
Springer
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...