The following pages link to R. A. Sitters (Q1304485):
Displaying 50 items.
- (Q417997) (redirect page) (← links)
- A note on sorting buffers offline (Q417998) (← links)
- Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
- Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays (Q612215) (← links)
- Competitive analysis of preemptive single-machine scheduling (Q614049) (← links)
- On the complexity of the highway problem (Q690481) (← links)
- The A priori traveling repairman problem (Q722527) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- The geometric generalized minimum spanning tree problem with grid clustering (Q882648) (← links)
- A short proof of a conjecture on the \(T_r\)-choice number of even cycles (Q1304486) (← links)
- The triangle scheduling problem (Q1617282) (← links)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- The Itinerant List Update problem (Q1757780) (← links)
- Scheduling reclaimer operations in the stockyard to minimize makespan (Q1782041) (← links)
- A priori TSP in the scenario model (Q1801079) (← links)
- A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
- On-line dial-a-ride problems under a restricted information model (Q1884776) (← links)
- The Chinese deliveryman problem (Q2025136) (← links)
- Fixed-order scheduling on parallel machines (Q2293084) (← links)
- Split scheduling with uniform setup times (Q2341391) (← links)
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q2417184) (← links)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
- On some special cases of the restricted assignment problem (Q2630343) (← links)
- Computer-Aided Complexity Classification of Dial-a-Ride Problems (Q2890414) (← links)
- Scheduling over Scenarios on Two Machines (Q2920492) (← links)
- On the Complexity of Master Problems (Q2946425) (← links)
- A priori TSP in the Scenario Model (Q2971168) (← links)
- TSP on Cubic and Subcubic Graphs (Q3009751) (← links)
- The Traveling Salesman Problem under squared Euclidean distances (Q3113753) (← links)
- Routing Under Uncertainty: The a priori Traveling Repairman Problem (Q3453299) (← links)
- How to Sell a Graph: Guidelines for Graph Retailers (Q3522949) (← links)
- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs (Q3527234) (← links)
- Approximability of Average Completion Time Scheduling on Unrelated Machines (Q3541134) (← links)
- The generalized two-server problem (Q3546319) (← links)
- Efficient Algorithms for Average Completion Time Scheduling (Q3569835) (← links)
- On the Value of Preemption in Scheduling (Q3595388) (← links)
- Minimizing Average Flow Time on Unrelated Machines (Q3602830) (← links)
- APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS (Q3636315) (← links)
- On Profit-Maximizing Pricing for the Highway and Tollbooth Problems (Q3648863) (← links)
- (Q4411400) (← links)
- (Q4449208) (← links)
- (Q4537758) (← links)
- (Q4633936) (← links)
- (Q4737530) (← links)
- Optimal pricing of capacitated networks (Q5191131) (← links)
- Polynomial time approximation schemes for the traveling repairman and other minimum latency problems. (Q5384007) (← links)
- The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem (Q5419031) (← links)
- On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems (Q5443510) (← links)
- On Approximating the TSP with Intersecting Neighborhoods (Q5459117) (← links)
