Pages that link to "Item:Q1014797"
From MaRDI portal
The following pages link to On dynamic bin packing: An improved lower bound and resource augmentation analysis (Q1014797):
Displaying 9 items.
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- Dynamic multi-dimensional bin packing (Q616986) (← links)
- A fundamental restriction on fully dynamic maintenance of bin packing (Q671611) (← links)
- Dynamic bin packing with unit fraction items revisited (Q1675820) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis (Q3591341) (← links)
- (Q5351895) (← links)
- Automata, Languages and Programming (Q5716813) (← links)
- Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups (Q6491686) (← links)