René Sitters

most citedThe Sorting Buffer Problem is NP-hard

10 citations · 11 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2014

Scheduling over Scenarios on Two Machines

Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp +4

We consider scheduling problems over scenarios where the goal is to find a single assignment of the jobs to the machines which performs well over all possible scenarios. Each scena…

cs.DS2010★ 10 cited

The Sorting Buffer Problem is NP-hard

Ho-Leung Chan, Nicole Megow, Rob van Stee +1

We consider the offline sorting buffer problem. The input is a sequence of items of different types. All items must be processed one by one by a server. The server is equipped with…

cs.CG2010★ 1 cited

The Traveling Salesman Problem Under Squared Euclidean Distances

Mark de Berg, Fred van Nijnatten, René Sitters +2

Let $P$ be a set of points in $R^{d}$ , and let $α \geq 1$ be a real number. We define the distance between two points $p, q \in P$ as $∣ pq ∣^{α}$ , where $∣ pq ∣$ denotes the standard…