146
click to vote
APPROX
15 years 10 months ago
2009 Springer 
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
142
Voted
APPROX
15 years 10 months ago
2009 Springer 
Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of...
153
click to vote
APPROX
15 years 10 months ago
2009 Springer 
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
127
click to vote
APPROX
15 years 10 months ago
2009 Springer 
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
131
Voted
APPROX
15 years 10 months ago
2009 Springer 
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
|
Algorithms