Preemptively guessing the center

DOI10.1007/978-3-319-96151-4_24zbMATH Open1445.68361OpenAlexW2883153745MaRDI QIDQ1661896FDOQ1661896

Authors: Christian Konrad, Tigran Tonoyan 

Publication date: 17 August 2018

Full work available at URL: https://research-information.bris.ac.uk/ws/files/187991020/kt18_13_camera_ready.pdf

Recommendations

• Entropy-based bounds for online algorithms
• Dynamic location problems with limited look-ahead
• Incremental medians via online bidding
• A guessing game and randomized online algorithms
• An approximate solution algorithm for the one-dimensional online median problem

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Cited In (1)

• Guessing fractions of online sequences

This page was built for publication: Preemptively guessing the center

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