Pages that link to "Item:Q2486751"
From MaRDI portal
The following pages link to Tight bounds for bandwidth allocation on two links (Q2486751):
Displayed 15 items.
- Parallel machine covering with limited number of preemptions (Q462268) (← 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)
- A note on hierarchical scheduling on two uniform machines (Q604878) (← links)
- Online scheduling with rejection and withdrawal (Q650898) (← links)
- On-line machine covering on two machines with local migration (Q660883) (← links)
- Inefficiency of equilibria for the machine covering game on uniform machines (Q715052) (← links)
- Semi-online machine covering on two uniform machines with known total size (Q858190) (← links)
- The hierarchical model for load balancing on two machines (Q927189) (← links)
- Machine covering with combined partial information (Q972842) (← links)
- Semi-online machine covering for two uniform machines (Q1034625) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Semi-online scheduling with ``end of sequence'' information (Q2460107) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Online Bounded Analysis (Q5740182) (← links)