René Sitters

According to our database, René Sitters authored at least 53 papers between 1999 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Exact and Approximation Algorithms for Routing a Convoy Through a Graph.

Martijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2021

Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems.

René Sitters

SIAM J. Comput., 2021

2020

The Chinese deliveryman problem.

Martijn van Ee, René Sitters

4OR, 2020

2019

Fixed-Order Scheduling on Parallel Machines.

Thomas Bosman, Dario Frascaria, Neil Olver, René Sitters, Leen Stougie

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018

Approximation and complexity of multi-target graph search and the Canadian traveler problem.

Martijn van Ee, René Sitters

Theor. Comput. Sci., 2018

The triangle scheduling problem.

Christoph Dürr, Zdenek Hanzálek, Christian Konrad, Yasmina Seddik, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger

J. Sched., 2018

A (2+ϵ)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective.

René Sitters, Liya Yang

Oper. Res. Lett., 2018

<i>A priori</i> TSP in the scenario model.

Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters

Discret. Appl. Math., 2018

The A Priori Traveling Repairman Problem.

Martijn van Ee, René Sitters

Algorithmica, 2018

The Itinerant List Update Problem.

Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, Leen Stougie

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

2017

Minimizing worst-case and average-case makespan over scenarios.

Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen

J. Sched., 2017

Approximability of average completion time scheduling on unrelated machines.

René Sitters

Math. Program., 2017

2016

Generalized Two-Server Problem.

René A. Sitters

Encyclopedia of Algorithms, 2016

On some special cases of the restricted assignment problem.

Chao Wang, René Sitters

Inf. Process. Lett., 2016

The triangle scheduling problem.

Christoph Dürr, Zdenek Hanzálek, Christian Konrad, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger

CoRR, 2016

A priori TSP in the Scenario Model.

Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

2015

Split scheduling with uniform setup times.

Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Víctor Verdugo, Anke van Zuylen

J. Sched., 2015

On the Complexity of Master Problems.

Martijn van Ee, René Sitters

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem.

René Sitters

SIAM J. Comput., 2014

The traveling salesman problem on cubic and subcubic graphs.

Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie

Math. Program., 2014

Routing Under Uncertainty: The a priori Traveling Repairman Problem.

Martijn van Ee, René Sitters

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Scheduling over Scenarios on Two Machines.

Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2012

On the complexity of the highway problem.

Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters

Theor. Comput. Sci., 2012

A note on sorting buffers offline.

Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee

Theor. Comput. Sci., 2012

2011

TSP on Cubic and Subcubic Graphs.

Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010

Competitive analysis of preemptive single-machine scheduling.

René Sitters

Oper. Res. Lett., 2010

The Sorting Buffer Problem is NP-hard

Ho-Leung Chan, Nicole Megow, Rob van Stee, René Sitters

CoRR, 2010

The Traveling Salesman Problem under Squared Euclidean Distances.

Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Efficient Algorithms for Average Completion Time Scheduling.

René Sitters

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009

Optimal pricing of capacitated networks.

Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz

Networks, 2009

Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods.

Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters

Int. J. Comput. Geom. Appl., 2009

On the minimum corridor connection problem and other generalized geometric problems.

Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle

Comput. Geom., 2009

Connected Feedback Vertex Set in Planar Graphs.

Alexander Grigoriev, René Sitters

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

On the approximability of the maximum feasible subsystem problem with 0/1-coefficients.

Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems.

Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2008

Generalized Two-Server Problem.

René A. Sitters

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Minimizing Average Flow Time on Unrelated Machines.

René A. Sitters

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

2007

A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs.

Khaled M. Elbassioni, René Sitters, Yan Zhang

Proceedings of the Algorithms, 2007

2006

The generalized two-server problem.

René A. Sitters, Leen Stougie

J. ACM, 2006

The geometric generalized minimum spanning tree problem with grid clustering.

Corinne Feremans, Alexander Grigoriev, René Sitters

4OR, 2006

How to Sell a Graph: Guidelines for Graph Retailers.

Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

On Approximating the TSP with Intersecting Neighborhoods.

Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

On the Value of Preemption in Scheduling.

Yair Bartal, Stefano Leonardi, Gil Shallom, René Sitters

Proceedings of the Approximation, 2006

2005

Complexity of preemptive minsum scheduling on unrelated parallel machines.

René Sitters

J. Algorithms, 2005

Approximation Algorithms for Euclidean Group TSP.

Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays.

Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, René Sitters

Proceedings of the Algorithms, 2005

2004

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

Willem de Paepe, Jan Karel Lenstra, Jirí Sgall, René A. Sitters, Leen Stougie

INFORMS J. Comput., 2004

On-Line Dial-a-Ride Problems Under a Restricted Information Model.

Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie

Algorithmica, 2004

2003

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

Xiwen Lu, René Sitters, Leen Stougie

Oper. Res. Lett., 2003

A Competitive Algorithm for the General 2-Server Problem.

René Sitters, Leen Stougie, Willem de Paepe

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

The Minimum Latency Problem Is NP-Hard for Weighted Trees.

René Sitters

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines.

René Sitters

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

1999

A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles.

René Sitters

Discret. Appl. Math., 1999