478 search results - page 10 / 96 » Approximation algorithms for general packing problems and th... |
ALGORITHMICA
2010
13 years 8 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
COMCOM
2006
13 years 8 months ago
2006
Nominee selection plays a key role in nominee-based congestion control, which is essential for multicast services to ensure fairness and congestion avoidance. Without valid design...
SIAMCOMP
2010
13 years 3 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
ISPD
2004
ACM
14 years 2 months ago
2004
ACM
Due to increasing design complexity, routing congestion has become a critical problem in VLSI designs. This paper introduces a distributed metric to predict routing congestion for...
ACTA
2008
13 years 8 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...