Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time

From MaRDI portal
(Redirected from Publication:287129)
Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time




No records found





Cited in

No records found






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item )