René Sitters

A class of on-line scheduling algorithms to minimize total completion time

Xinrong Lu, René Sitters, Leen Stougie · Operations Research Letters · 2003 · 67 citations

Computing, Computer Science, Industrial Engineering +12

APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS

Khaled Elbassioni, Aleksei V. Fishkin, René Sitters · International Journal of Computational Geometry & Applications · 2009 · 57 citations

Computing, Computer Science, Algorithms +10

Computer-Aided Complexity Classification of Dial-a-Ride Problems

Willem E. de Paepe, Jan Karel Lenstra, René Sitters et al. · INFORMS journal on computing · 2004 · 52 citations · Full text

Computing, Computer Science, Mathematics +16

Approximation Algorithms for Euclidean Group TSP

Khaled Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa et al. · Lecture notes in computer science · 2005 · 44 citations

Computing, Computer Science, Mathematics +14

The geometric generalized minimum spanning tree problem with grid clustering

Corinne Feremans, Alexander Grigoriev, René Sitters · 4OR · 2006 · 38 citations

Computing, Computer Science, Computational Geometry +9