120 search results - page 10 / 24 » On Bin Packing with Conflicts |
DAM
2008
13 years 7 months ago
2008
ct The average case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [?], Kenyon introduced the random-order ratio, a new average case...
EOR
2007
13 years 7 months ago
2007
This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptoti...
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
We prove that Best Fit bin packing has linear waste on the discrete distribution Ufj kg (where items are drawn uniformly from the set f1=k 2=3 j=kg) for sufficiently large k when...
AOR
2006
13 years 7 months ago
2006
The problem of on-line bin packing restricted to instances with only two item sizes (known in advance) has a well-known lower bound of 4/3 for its asymptotic competitive ratio. We...
EOR
2007
13 years 7 months ago
2007
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...