87
Voted
ACTA
2008
14 years 9 months ago
2008
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
55
Voted
ACTA
2008
14 years 11 months ago
2008
92
Voted
ACTA
2008
14 years 11 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 ...
81
Voted
ACTA
2008
14 years 11 months ago
2008
Abstract. We introduce an adaptation of run-relaxed heaps which provides efficient heap operations with respect to the number of element comparisons performed. Our data structure g...