Login / Signup

A nearly optimal randomized algorithm for explorable heap selection.

Sander BorstDaniel DadushSophie HuibertsDanish Kashaev
Published in: CoRR (2022)
Keyphrases
  • randomized algorithm
  • optimal solution
  • greedy algorithm
  • dynamic programming
  • competitive ratio
  • machine learning
  • reinforcement learning