Pages that link to "Item:Q2268512"
From MaRDI portal
The following pages link to The worst-case analysis of the Garey-Johnson algorithm (Q2268512):
Displaying 8 items.
- Worst case analysis of a greedy algorithm for graph thickness (Q1007554) (← links)
- Two deadline reduction algorithms for scheduling dependent tasks on parallel processors (Q2117220) (← links)
- The worst-case analysis of the Garey-Johnson algorithm (Q2268512) (← links)
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays (Q2400440) (← links)
- Performance of Garey-Johnson algorithm for pipelined typed tasks systems (Q3002561) (← links)
- Beyond the Worst-Case Analysis of Algorithms (Q5118515) (← links)
- On the worst-case inefficiency of CGKA (Q6114271) (← links)
- Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines (Q6547133) (← links)