Pages that link to "Item:Q5898467"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5898467):
Displaying 11 items.
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size (Q511074) (← links)
- Optimal semi-online algorithms for machine covering (Q870840) (← links)
- Machine covering with combined partial information (Q972842) (← links)
- Semi-online machine covering for two uniform machines (Q1034625) (← links)
- The cost of selfishness for maximizing the minimum load on uniformly related machines (Q2015810) (← links)
- Improved approaches to the exact solution of the machine covering problem (Q2398644) (← links)
- Optimal algorithms for semi-online machine covering on two hierarchical machines (Q2441779) (← links)
- On-line machine covering (Q5906280) (← links)
- Machine covering in the random-order model (Q6103518) (← links)