René Sitters

activity

20092025

most citedOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems

17 citations · 29 across the 9 of their papers we have counts for

collaborators

Showing 2010Show all

2 papers · 1 filter

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…