117 search results - page 10 / 24 » Selfish Bin Packing |
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...
AISS
2010
13 years 5 months ago
2010
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
WAOA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...