The following pages link to (Q5351895):
Displaying 13 items.
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- A fundamental restriction on fully dynamic maintenance of bin packing (Q671611) (← links)
- Deep performance analysis of refined harmonic bin packing algorithm (Q1613251) (← links)
- Dynamic bin packing with unit fraction items revisited (Q1675820) (← links)
- Robust algorithms for total completion time (Q2010916) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- Online bin covering with limited migration (Q2689369) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis (Q3591341) (← links)
- Online strip packing with polynomial migration (Q5002616) (← links)
- Fully-Dynamic Bin Packing with Little Repacking (Q5002726) (← links)
- Symmetry exploitation for online machine covering with bounded migration (Q5009591) (← links)
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)