Rob van Stee
YOU?
Author Swipe
View article: The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts Open
We consider the online buffer minimization in multiprocessor systems with conflicts problem (in short, the buffer minimization problem) in the recently introduced flow model. In an online fashion, workloads arrive on some of the $n$ proces…
View article: Improved online load balancing with known makespan
Improved online load balancing with known makespan Open
We break the barrier of $3/2$ for the problem of online load balancing with known makespan, also known as bin stretching. In this problem, $m$ identical machines and the optimal makespan are given. The load of a machine is the total size o…
View article: Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5
Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5 Open
View article: A two-phase algorithm for bin stretching with stretching factor 1.5
A two-phase algorithm for bin stretching with stretching factor 1.5 Open
View article: Online bin stretching with three bins
Online bin stretching with three bins Open
View article: Improved Lower Bounds for Online Hypercube Packing
Improved Lower Bounds for Online Hypercube Packing Open
Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing hypercubes into bins in two or more dimensions, once for general algorithms (in two dimens…
View article: Improved Lower Bounds for Online Hypercube and Rectangle Packing
Improved Lower Bounds for Online Hypercube and Rectangle Packing Open
Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing boxes into bins in two or more dimensions, both for general algorithms for squares and rec…
View article: SIGACT News Online Algorithms Column 28
SIGACT News Online Algorithms Column 28 Open
research-article Share on SIGACT News Online Algorithms Column 28: Online Matching on the Line, Part 2 Author: Rob van Stee University of Leicester, United Kingdom University of Leicester, United KingdomView Profile Authors Info & Claims A…
View article: SIGACT News Online Algorithms Column 27
SIGACT News Online Algorithms Column 27 Open
research-article Share on SIGACT News Online Algorithms Column 27: Online Matching on the Line, Part 1 Author: Rob van Stee University of Leicester, Leicester, United Kingdom University of Leicester, Leicester, United KingdomView Profile A…
View article: The Best Two-Phase Algorithm for Bin Stretching
The Best Two-Phase Algorithm for Bin Stretching Open
Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking,…
View article: Beating the Harmonic Lower Bound for Online Bin Packing
Beating the Harmonic Lower Bound for Online Bin Packing Open
In the online bin packing problem, items of sizes in (0,1] arrive online to be packed into bins of size 1. The goal is to minimize the number of used bins. Harmonic++ achieves a competitive ratio of 1.58889 and belongs to the Super Harmoni…
View article: A Unified Approach to Truthful Scheduling on Related Machines
A Unified Approach to Truthful Scheduling on Related Machines Open
We present a unified framework for designing deterministic monotone polynomial time approximation schemes (PTASs) for a wide class of scheduling problems on uniformly related machines. This class includes (among others) minimizing the make…
View article: Beating the Harmonic lower bound for online bin packing
Beating the Harmonic lower bound for online bin packing Open
In the online bin packing problem, items of sizes in (0,1] arrive online to be packed into bins of size 1. The goal is to minimize the number of used bins. In this paper, we present an online bin packing algorithm with asymptotic competiti…
View article: Online algorithms with advice for bin packing and scheduling problems
Online algorithms with advice for bin packing and scheduling problems Open
View article: Dividing connected chores fairly
Dividing connected chores fairly Open
View article: SIGACT News Online Algorithms Column 26
SIGACT News Online Algorithms Column 26 Open
I mentioned in a previous column [22] that the best known lower bound for the two-dimensional
\nonline bin packing problem is 1.907 by Blitz, van Vliet, Woeginger [2], which is an unpublished
\n(and now lost [24]) manuscript. I have realiz…