Pages that link to "Item:Q557905"
From MaRDI portal
The following pages link to Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905):
Displaying 8 items.
- Semi-online machine covering for two uniform machines (Q1034625) (← links)
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← links)
- Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
- Preemptive semi-online algorithms for parallel machine scheduling with known total size (Q2508575) (← links)
- Preemptive machine covering on parallel machines (Q2583174) (← links)
- General max-min fair allocation (Q2695275) (← links)
- Approximation and Online Algorithms (Q5898467) (← links)
- Polynomial-time combinatorial algorithm for general max-min fair allocation (Q6182677) (← links)