Pages that link to "Item:Q5896920"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5896920):
Displaying 8 items.
- Hierarchies for classes of priority algorithms for job scheduling (Q818127) (← links)
- Models of greedy algorithms for graph problems (Q834580) (← links)
- Characterizing sets of jobs that admit optimal greedy-like algorithms (Q964871) (← links)
- Randomized priority algorithms (Q974749) (← links)
- (Incremental) priority algorithms (Q1762982) (← links)
- Priority algorithms for makespan minimization in the subset model. (Q1853127) (← links)
- The power of priority algorithms for facility location and set cover (Q1884771) (← links)
- On the Structure of Optimal Greedy Computation (for Job Scheduling) (Q3182959) (← links)