مرکز منطقه ای اطلاع رساني علوم و فناوري - Partially dynamic bin packing can be solved within 1 + in (amortized) polylogarithmic time

Title of article :

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

Author/Authors :

Zoran Ivkovi ، نويسنده , , Errol L. Lloyd، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 1997

Pages :

From page :

To page :

Keywords :

Bin packing , computational complexity , Algorithms

Journal title :

Information Processing Letters

Serial Year :

1997

Journal title :

Information Processing Letters

Record number :

128715

Link To Document :