René Sitters

发表

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

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

On Approximating the TSP with Intersecting Neighborhoods

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

D S ] 1 M ay 2 01 6 The triangle scheduling problem

Óscar C. Vásquez, G. Woeginger, C. Dürr, 2018 .

Efficient Algorithms for Average Completion Time Scheduling

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

On the minimum corridor connection and other generalized geometric problems

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

Scheduling over scenarios

L. Stougie, Frans Schalekamp, A. V. Zuylen, 2015 .

The struggle for beating Chris- tofides: approximation of metric TSP

L. Stougie, René Sitters, 2012 .

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

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

Approximability of average completion time scheduling on unrelated machines

René Sitters, 2008, ESA.

Scheduling Reclaimer Operations in the Stockyard to Minimize Makespan

Xiwen Lu, René Sitters, Chao Wang, 2018, Acta Mathematicae Applicatae Sinica, English Series.

Scheduling Reclaimer Operations in the Stockyard to Minimize Makespan

René Sitters, Chao Wang, Xi wen Lu, 2018, Acta Mathematicae Applicatae Sinica, English Series.

The generalized two-server problem

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

Complexity and approximation in routing and scheduling

René Sitters, René Sitters, 2004 .

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems

Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, 2009, SAGT.

Minimizing worst-case and average-case makespan over scenarios

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

Scheduling over Scenarios on Two Machines

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

Optimal pricing of capacitated networks

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

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

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

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

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

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

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

A priori TSP in the Scenario Model

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

The Itinerant List Update Problem

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

On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems

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

The Minimum Latency Problem Is NP-Hard for Weighted Trees

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

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..

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

René Sitters, René Sitters, 2009 .

TSP on Cubic and Subcubic Graphs

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

On the complexity of the highway problem

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

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

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

How to Sell a Graph: Guidelines for Graph Retailers

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

The geometric generalized minimum spanning tree problem with grid clustering

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

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..

Approximation Algorithms for Euclidean Group TSP

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

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

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

Complexity of preemptive minsum scheduling on unrelated parallel machines

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