HIGHLIGHTS
- who: Sebastian Berndt and collaborators from the Department of Computer Science, Kiel University, Kiel, Germany have published the paper: Online Bin Covering with Limited Migration, in the Journal: (JOURNAL)
- what: The authors develop algorithms both for the static case - where only insertions are allowed - and for the dynamic case where items may also depart.
SUMMARY
Keyword and phrases online algorithms, dynamic algorithms, competitive ratio, bin covering, migration factor Digital Object Identifier 10.4230/LIPIcs.ESA.2019.18 Related Version A full version of the paper is available at https://arxiv.org . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.