Pages that link to "Item:Q5002726"
From MaRDI portal
The following pages link to Fully-Dynamic Bin Packing with Little Repacking (Q5002726):
Displaying 16 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)
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Online load balancing with general reassignment cost (Q2157902) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- Online bin covering with limited migration (Q2689369) (← links)
- Online Bin Covering with Limited Migration (Q5075753) (← links)
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)
- (Q5351895) (← links)
- Streaming algorithms for bin packing and vector scheduling (Q5919096) (← links)
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching (Q6084396) (← links)
- Online load balancing on uniform machines with limited migration (Q6106523) (← links)
- Online minimization of the maximum starting time: migration helps (Q6174813) (← links)
- Stable and dynamic minimum cuts (Q6575402) (← links)