René Sitters

发表

On-Line Dial-a-Ride Problems under a Restricted Information Model

Leen Stougie, Maarten Lipmann, Xiwen Lu, 2002, ESA.

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

Leen Stougie, Maarten Lipmann, Xiwen Lu, 2004, Algorithmica.

On the Value of Preemption in Scheduling

René Sitters, Stefano Leonardi, Yair Bartal, 2006, APPROX-RANDOM.

Routing Under Uncertainty: The a priori Traveling Repairman Problem

René Sitters, Martijn van Ee, 2014, WAOA.

Efficient algorithms for average completion time scheduling, Lecture notes in Computer Science 6080

René Sitters, 2010 .

Optimal pricing of capacitated networks

Alexander Grigoriev, René Sitters, Marc Uetz, 2009, Networks.

A priori TSP in the Scenario Model

Leo van Iersel, René Sitters, Martijn van Ee, 2016, WAOA.

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

René Sitters, Liya Yang, René Sitters, 2017, Oper. Res. Lett..

The Sorting Buffer Problem is NP-hard pdf

René Sitters, Rob van Stee, Nicole Megow, 2010, ArXiv.

Connected Feedback Vertex Set in Planar Graphs

Alexander Grigoriev, René Sitters, 2009, WG.

Approximation Algorithms for Euclidean Group TSP

Khaled M. Elbassioni, Nabil H. Mustafa, René Sitters, 2005, ICALP.

Complexity of preemptive minsum scheduling on unrelated parallel machines

René Sitters, René Sitters, 2005, J. Algorithms.

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

Yan Zhang, Khaled M. Elbassioni, René Sitters, 2007, ESA.

The traveling salesman problem on cubic and subcubic graphs

Leen Stougie, René Sitters, Suzanne van der Ster, 2014, Math. Program..

Generalized Two-Server Problem

René Sitters, 2016, Encyclopedia of Algorithms.

How to Sell a Graph: Guidelines for Graph Retailers

Alexander Grigoriev, René Sitters, Marc Uetz, 2006, WG.

On the complexity of the highway problem

Khaled M. Elbassioni, Rajiv Raman, René Sitters, 2012, Theor. Comput. Sci..

Polynomial time approximation schemes for the traveling repairman and other minimum latency problems pdf

René Sitters, René Sitters, 2013, SODA.

On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems

Alexander Grigoriev, René Sitters, Thomas Wolle, 2006, WAOA.

Competitive analysis of preemptive single-machine scheduling

René Sitters, 2010, Oper. Res. Lett..

TSP on Cubic and Subcubic Graphs

Leen Stougie, René Sitters, Suzanne van der Ster, 2011, IPCO.

Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays

René Sitters, Aleksei V. Fishkin, S. V. Sevastyanov, 2010 .

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

René Sitters, René Sitters, 2011, SIAM J. Comput..

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

Leen Stougie, Xiwen Lu, René Sitters, 2003, Oper. Res. Lett..

A PTAS for the Multiple Depot Vehicle Routing Problem

Leen Stougie, René Sitters, Ceyhun Eksin, 2008 .

Optimal pricing of capacitated networks

Alexander Grigoriev, René Sitters, Marc Uetz, 2009 .

The Minimum Latency Problem Is NP-Hard for Weighted Trees

René Sitters, René Sitters, 2002, IPCO.

The general two-server problem

Leen Stougie, René Sitters, 2003 .

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

Klaus Jansen, René Sitters, Aleksei V. Fishkin, 2005, ESA.

Minimizing Average Flow Time on Unrelated Machines

René Sitters, 2008, WAOA.

On some special cases of the restricted assignment problem

Chao Wang, René Sitters, 2016, Inf. Process. Lett..

On Approximating the TSP with Intersecting Neighborhoods

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

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

René Sitters, 2001, IPCO.

Generalized Two-Server Problem

René Sitters, 2008, Encyclopedia of Algorithms.

Complexity and approximation in routing and scheduling

René Sitters, René Sitters, 2004 .

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

Jan Karel Lenstra, Leen Stougie, Willem de Paepe, 2004, INFORMS J. Comput..

On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems

Alexander Grigoriev, René Sitters, Thomas Wolle, 2006, WAOA.

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

Khaled M. Elbassioni, René Sitters, Aleksei V. Fishkin, 2009, Int. J. Comput. Geom. Appl..

Efficient Algorithms for Average Completion Time Scheduling

René Sitters, René Sitters, 2010, IPCO.

Fixed-Order Scheduling on Parallel Machines

Leen Stougie, René Sitters, Neil Olver, 2019, IPCO.

The generalized two-server problem

Leen Stougie, René Sitters, René Sitters, 2006, JACM.

The Chinese deliveryman problem

René Sitters, Martijn van Ee, 2020, 4OR.

The triangle scheduling problem

Gerhard J. Woeginger, Zdenek Hanzálek, René Sitters, 2018, J. Sched..

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

René Sitters, 1999, Discret. Appl. Math..

Scheduling over Scenarios on Two Machines

Leen Stougie, René Sitters, Alberto Marchetti-Spaccamela, 2014, COCOON.

The A Priori Traveling Repairman Problem

René Sitters, Martijn van Ee, 2017, Algorithmica.

Approximability of average completion time scheduling on unrelated machines

René Sitters, 2017, Math. Program..

On the minimum corridor connection and other generalized geometric problems

Thomas Erlebach, Alexander Grigoriev, René Sitters, 2006 .

A note on sorting buffers offline

René Sitters, Rob van Stee, Nicole Megow, 2012, Theor. Comput. Sci..

A priori TSP in the scenario model

Leo van Iersel, René Sitters, Martijn van Ee, 2018, Discret. Appl. Math..

On the Complexity of Master Problems

René Sitters, Martijn van Ee, 2015, MFCS.

The geometric generalized minimum spanning tree problem with grid clustering

Alexander Grigoriev, René Sitters, Corinne Feremans, 2006, 4OR.

Approximability of Average Completion Time Scheduling on Unrelated Machines

René Sitters, 2008, ESA.

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

René Sitters, Martijn van Ee, René Sitters, 2018, Theor. Comput. Sci..

The Itinerant List Update Problem

Kirk Pruhs, Leen Stougie, René Sitters, 2018, WAOA.

Split scheduling with uniform setup times

Leen Stougie, René Sitters, Suzanne van der Ster, 2015, J. Sched..

Minimizing worst-case and average-case makespan over scenarios

Leen Stougie, René Sitters, Alberto Marchetti-Spaccamela, 2017, J. Sched..

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

Khaled M. Elbassioni, Rajiv Raman, René Sitters, 2009, SODA.

A Competitive Algorithm for the General 2-Server Problem

Leen Stougie, Willem de Paepe, René Sitters, 2003, ICALP.

Efficient algorithms for average completion time scheduling Research Memorandum 2009-58

René Sitters, René Sitters, 2009 .