R. A. Sitters

Available identifiers

zbMath Open sitters.rene-aMaRDI QIDQ1304485

List of research outcomes

Publication	Date of Publication	Type
Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems	2021-11-19	Paper
The Chinese deliveryman problem	2021-05-11	Paper
Fixed-order scheduling on parallel machines	2020-02-06	Paper
Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.	2019-06-20	Paper
A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective	2019-06-11	Paper
https://portal.mardi4nfdi.de/entity/Q4633936	2019-05-06	Paper
The Itinerant List Update problem	2019-01-15	Paper
The triangle scheduling problem	2018-11-07	Paper
A priori TSP in the scenario model	2018-10-26	Paper
Scheduling reclaimer operations in the stockyard to minimize makespan	2018-09-18	Paper
The A priori traveling repairman problem	2018-07-26	Paper
Approximation and complexity of multi-target graph search and the Canadian traveler problem	2018-06-07	Paper
Minimizing worst-case and average-case makespan over scenarios	2018-02-28	Paper
A $(2 + \epsilon)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective	2017-06-23	Paper
A priori TSP in the Scenario Model	2017-04-04	Paper
Approximability of average completion time scheduling on unrelated machines	2017-02-03	Paper
On some special cases of the restricted assignment problem	2016-07-27	Paper
Routing Under Uncertainty: The a priori Traveling Repairman Problem	2015-11-20	Paper
On the Complexity of Master Problems	2015-09-16	Paper
Split scheduling with uniform setup times	2015-04-24	Paper
Scheduling over Scenarios on Two Machines	2014-09-26	Paper
The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem	2014-06-04	Paper
The traveling salesman problem on cubic and subcubic graphs	2014-06-02	Paper
On the complexity of the highway problem	2012-11-27	Paper
Computer-Aided Complexity Classification of Dial-a-Ride Problems	2012-06-08	Paper
A note on sorting buffers offline	2012-05-14	Paper
The Traveling Salesman Problem under squared Euclidean distances	2012-01-23	Paper
TSP on Cubic and Subcubic Graphs	2011-06-24	Paper
Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays	2011-01-03	Paper
Competitive analysis of preemptive single-machine scheduling	2010-12-23	Paper
Efficient Algorithms for Average Completion Time Scheduling	2010-06-22	Paper
Connected Feedback Vertex Set in Planar Graphs	2010-01-21	Paper
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems	2009-12-01	Paper
On the minimum corridor connection problem and other generalized geometric problems	2009-08-14	Paper
Optimal pricing of capacitated networks	2009-07-28	Paper
APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS	2009-06-30	Paper
Minimizing Average Flow Time on Unrelated Machines	2009-02-12	Paper
The generalized two-server problem	2008-12-21	Paper
Approximability of Average Completion Time Scheduling on Unrelated Machines	2008-11-25	Paper
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs	2008-09-25	Paper
How to Sell a Graph: Guidelines for Graph Retailers	2008-09-04	Paper
On Approximating the TSP with Intersecting Neighborhoods	2008-04-24	Paper
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems	2008-02-21	Paper
On the Value of Preemption in Scheduling	2007-08-28	Paper
The geometric generalized minimum spanning tree problem with grid clustering	2007-05-24	Paper
Algorithms – ESA 2005	2006-06-27	Paper
Automata, Languages and Programming	2006-01-10	Paper
Complexity of preemptive minsum scheduling on unrelated parallel machines	2005-11-16	Paper
On-line dial-a-ride problems under a restricted information model	2004-11-05	Paper
https://portal.mardi4nfdi.de/entity/Q4737530	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4449208	2004-02-08	Paper
https://portal.mardi4nfdi.de/entity/Q4411400	2003-07-08	Paper
A class of on-line scheduling algorithms to minimize total completion time	2003-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4537758	2002-06-20	Paper
A short proof of a conjecture on the \(T_r\)-choice number of even cycles	2000-02-23	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: R. A. Sitters