Tight Bounds for Clairvoyant Dynamic Bin Packing

AzarYossi,VainsteinDanny

Tight Bounds for Clairvoyant Dynamic Bin Packing

2019

AzarYossi
VainsteinDanny

In this article, we focus on the Clairvoyant Dynamic Bin Packing (DBP) problem, which extends the Classical Online Bin Packing problem in that items arrive and depart over time and the departure ti...

Keywords:

Online algorithm
Competitive analysis
Bin packing problem
Analysis of algorithms
Theoretical computer science
Computer science

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations