The following pages link to Rob van Stee (Q199230):
Displaying 50 items.
- Online scheduling of jobs with fixed start times on related machines (Q261353) (← links)
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- A \((5/3+\varepsilon)\)-approximation for strip packing (Q390133) (← links)
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- Real-time integrated prefetching and caching (Q398835) (← links)
- A note on sorting buffers offline (Q417998) (← links)
- An improved algorithm for online rectangle filling (Q418006) (← links)
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- Online algorithms with advice for bin packing and scheduling problems (Q496020) (← links)
- Dividing connected chores fairly (Q500994) (← links)
- An approximation algorithm for square packing. (Q703277) (← links)
- Improved competitive guarantees for QoS buffering (Q818829) (← links)
- A study of integrated document and connection caching in the WWW (Q878433) (← links)
- Paging with connections: FIFO strikes again (Q884462) (← links)
- Speed scaling of tasks with precedence constraints (Q927406) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
- Online unit clustering: Variations on a theme (Q954982) (← links)
- Maximizing the minimum load for selfish agents (Q1041221) (← links)
- Partial servicing of on-line jobs (Q1348740) (← links)
- New bounds for multidimensional packing (Q1400897) (← links)
- Preemptive scheduling in overloaded systems. (Q1401985) (← links)
- More on weighted servers or FIFO is better than LRU. (Q1426456) (← links)
- Resource augmentation in load balancing. (Q1588053) (← links)
- A two-phase algorithm for bin stretching with stretching factor 1.5 (Q1680492) (← links)
- Online bin stretching with three bins (Q1702659) (← links)
- Reordering buffer management with advice (Q1707821) (← links)
- The optimal absolute ratio for online bin packing (Q1741486) (← links)
- Minimizing the maximum starting time on-line (Q1763375) (← links)
- Lower bounds for on-line single-machine scheduling. (Q1874403) (← links)
- Combining request scheduling with web caching (Q1887085) (← links)
- The cost of selfishness for maximizing the minimum load on uniformly related machines (Q2015810) (← links)
- Allocating contiguous blocks of indivisible chores fairly (Q2051776) (← links)
- Paging with request sets (Q2272199) (← links)
- Online bin packing with resource augmentation (Q2427692) (← links)
- Approximation schemes for packing splittable items with cardinality constraints (Q2428665) (← links)
- Improved results for a memory allocation problem (Q2429723) (← links)
- Absolute approximation ratios for packing rectangles into bins (Q2434269) (← links)
- Calculating lower bounds for caching problems (Q2460920) (← links)
- Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem (Q2464382) (← links)
- Bounds for online bounded space hypercube packing (Q2467129) (← links)
- Optimal on-line flow time with resource augmentation (Q2489955) (← links)
- (Q2721978) (← links)
- (Q2753745) (← links)
- A unified approach to truthful scheduling on related machines (Q2800378) (← links)
- Dividing Connected Chores Fairly (Q2856141) (← links)
- Online scheduling of splittable tasks (Q2944507) (← links)
- This side up! (Q2944514) (← links)
- An Improved Algorithm for Online Rectangle Filling (Q3075466) (← links)
- Online Scheduling of Jobs with Fixed Start Times on Related Machines (Q3167391) (← links)
