The following pages link to (Q5755525):
Displaying 8 items.
- Online algorithms with advice: the tape model (Q529045) (← links)
- Complexity, bounds and dynamic programming algorithms for single track train scheduling (Q1730675) (← links)
- Job shop scheduling with unit length tasks (Q2905324) (← links)
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
- Advice Complexity and Barely Random Algorithms (Q3075527) (← links)
- On the power of randomization for job shop scheduling with<i>k</i>-units length tasks (Q3625688) (← links)
- Advice Complexity and Barely Random Algorithms (Q5198936) (← links)
- Firefly-Inspired Algorithm for Job Shop Scheduling (Q6163642) (← links)