English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

The Itinerant List Update Problem

MPS-Authors
/persons/resource/persons230070

Schewior,  Kevin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45495

Sitters,  Rene
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Olver, N., Pruhs, K., Schewior, K., Sitters, R., & Stougie, L. (2018). The Itinerant List Update Problem. In L. Epstein, & T. Erlebach (Eds.), Approximation and Online Algorithms (pp. 310-326). Berlin: Springer.


Cite as: https://hdl.handle.net/21.11116/0000-0002-F4BA-9
Abstract
There is no abstract available