Pages that link to "Item:Q1853127"
From MaRDI portal
The following pages link to Priority algorithms for makespan minimization in the subset model. (Q1853127):
Displayed 10 items.
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- A stronger model of dynamic programming algorithms (Q547305) (← links)
- Hierarchies for classes of priority algorithms for job scheduling (Q818127) (← links)
- Characterizing sets of jobs that admit optimal greedy-like algorithms (Q964871) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Priority algorithms for the subset-sum problem (Q1029701) (← links)
- On the Structure of Optimal Greedy Computation (for Job Scheduling) (Q3182959) (← links)
- Advice complexity of priority algorithms (Q5916086) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)