The itinerant list update problem

DOI10.1007/978-3-030-04693-4_19OpenAlexW2903474319MaRDI QIDQ1757780FDOQ1757780

Authors: Neil Olver, Kevin Schewior, L. Stougie, Kirk Pruhs, René A. Sitters 

Publication date: 15 January 2019

Full work available at URL: https://hal.inria.fr/hal-01972562/file/waoa.pdf

Recommendations

• A Survey of Algorithms and Models for List Update
• Online and Offline Access to Short Lists
• On list update and work function algorithms.
• On list update with locality of reference
• On List Update with Locality of Reference

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Approximation algorithms (68W25)

Cited In (6)

• Wernick's list: a final update
• Self-adjusting linear networks with ladder demand graph
• Online multistage subset maximization problems
• A simple rounding scheme for multistage optimization
• LP-based algorithms for multistage minimization problems
• Title not available (Why is that?)

This page was built for publication: The itinerant list update problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1757780)