On Online Algorithms for Bin, Strip, and Box Packing, and Their Worst-Case and Average-Case Analysis


Дәйексөз келтіру

Толық мәтін

Ашық рұқсат Ашық рұқсат
Рұқсат жабық Рұқсат берілді
Рұқсат жабық Тек жазылушылар үшін

Аннотация

In this survey, we consider online algorithms for bin packing and strip packing problems, as well as their generalizations (multidimensional bin packing, multiple strip packing, and packing into strips of different widths). For the latter problem, only the worst-case analysis is described; for the other problems, both the worst-case and average-case (probabilistic) asymptotic ratios are presented. The best lower and upper bounds are considered. Basic algorithms and methods for their analysis are discussed.

Авторлар туралы

D. Lazarev

Ivannikov Institute for System Programming, Russian Academy of Sciences; Moscow Institute of Physics and Technology

Хат алмасуға жауапты Автор.
Email: dennis810@mail.ru
Ресей, ul. Solzhenitsyna 25, Moscow, 109004; Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700

N. Kuzyurin

Ivannikov Institute for System Programming, Russian Academy of Sciences; Moscow Institute of Physics and Technology

Хат алмасуға жауапты Автор.
Email: nnkuz@ispras.ru
Ресей, ul. Solzhenitsyna 25, Moscow, 109004; Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700

Қосымша файлдар

Қосымша файлдар
Әрекет
1. JATS XML

© Pleiades Publishing, Ltd., 2019