Pages that link to "Item:Q287129"

The following pages link to Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129):

Displaying 5 items.

• Semi-on-line bin packing: a short overview and a new lower bound (Q301113) (← links)
• A robust APTAS for the classical bin packing problem (Q1013966) (← links)
• Batched bin packing (Q1779689) (← links)
• Fully dynamic bin packing revisited (Q2288188) (← links)
• A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)