Pages that link to "Item:Q4210166"
From MaRDI portal
The following pages link to Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps (Q4210166):
Displaying 16 items.
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- Semi-on-line bin packing: a short overview and a new lower bound (Q301113) (← links)
- A fundamental restriction on fully dynamic maintenance of bin packing (Q671611) (← links)
- Resource augmented semi-online bounded space bin packing (Q967321) (← links)
- A robust APTAS for the classical bin packing problem (Q1013966) (← links)
- Improved lower bounds for semi-online bin packing problems (Q1014344) (← links)
- On dynamic bin packing: An improved lower bound and resource augmentation analysis (Q1014797) (← links)
- Dynamic bin packing with unit fraction items revisited (Q1675820) (← links)
- Batched bin packing (Q1779689) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- Dynamic bin packing of unit fractions items (Q2378533) (← links)
- On-line bin packing with restricted repacking (Q2436663) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Fully-Dynamic Bin Packing with Little Repacking (Q5002726) (← links)
- Dynamic Windows Scheduling with Reallocation (Q5102055) (← links)
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)
