The following pages link to (Q4411275):
Displaying 10 items.
- 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)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- Bubblesearch: a simple heuristic for improving priority-based greedy algorithms (Q1045924) (← 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)
- Approximation and Online Algorithms (Q5896920) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)