58 search results - page 3 / 12 » Improved competitive ratio for the matroid secretary problem |
94
Voted
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
76
Voted
ICPP
1998
IEEE
15 years 1 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
WAOA
2007
Springer
15 years 3 months ago
2007
Springer
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
81
Voted
COCOON
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...