Pages that link to "Item:Q2427692"
From MaRDI portal
The following pages link to Online bin packing with resource augmentation (Q2427692):
Displaying 9 items.
- Measuring the impact of adversarial errors on packet scheduling strategies (Q282242) (← links)
- (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation (Q386436) (← links)
- Tight results for next fit and worst fit with resource augmentation (Q974751) (← links)
- On dynamic bin packing: An improved lower bound and resource augmentation analysis (Q1014797) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Fault tolerant scheduling of tasks of two sizes under resource augmentation (Q1702666) (← links)
- Optimal Resource Augmentations for Online Knapsack (Q3603464) (← links)
- A new and improved algorithm for online bin packing (Q5009562) (← links)
- Approximation and Online Algorithms (Q5713446) (← links)