Titlebook: Approximation and Online Algorithms; 17th International W Evripidis Bampis,Nicole Megow Conference proceedings 2020 Springer Nature Switzer

口音在加重

Gentry

Mucosa

伸展

https://doi.org/10.1007/978-3-030-39479-0approximation algorithms; approximation ratios; approximation theory; artificial intelligence; bin packi

Blanch

逗留

Robust Online Algorithms for Certain Dynamic Packing Problems,hm..While these criteria are naturally fulfilled by many dynamic problems, they are especially suited for packing problems. In order to show the usefulness of our approach in this area, we improve upon the best known robust algorithms for the dynamic versions of generalizations of Strip Packing and

arcane

Streaming Algorithms for Bin Packing and Vector Scheduling, Our algorithm implies a streaming .-approximation for . in . dimensions, running in space .. For the related . problem, we show how to construct an input summary in space . that preserves the optimum value up?to a factor of ., where . is the number of identical machines.