Pages that link to "Item:Q2288188"
From MaRDI portal
The following pages link to Fully dynamic bin packing revisited (Q2288188):
Displaying 21 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)
- Dynamic bin packing with unit fraction items revisited (Q1675820) (← links)
- Starting time minimization for the maximum job variant (Q2057591) (← links)
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
- More on ordered open end bin packing (Q2066681) (← links)
- Online scheduling with migration on two hierarchical machines (Q2091110) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Online load balancing with general reassignment cost (Q2157902) (← links)
- A note on a variant of the online open end bin packing problem (Q2661578) (← links)
- Black and White Bin Packing Revisited (Q3467833) (← links)
- On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis (Q3591341) (← links)
- Online strip packing with polynomial migration (Q5002616) (← links)
- Online Bin Covering with Limited Migration (Q5075753) (← links)
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)
- (Q5351895) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
- Online load balancing on uniform machines with limited migration (Q6106523) (← links)
- Online minimization of the maximum starting time: migration helps (Q6174813) (← links)
- Tighter bounds for the harmonic bin packing algorithm (Q6586257) (← links)