93 search results - page 8 / 19 » Online Primal-Dual Algorithms for Covering and Packing Probl... |
STOC
2010
ACM
14 years 12 days ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
DAM
2010
13 years 7 months ago
2010
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...
MFCS
2005
Springer
14 years 1 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...