17 citations · 24 across the 15 of their papers we have counts for
1 paper · 1 filter
Anders Aamand, Justin Y. Chen, Piotr Indyk
We propose a model for online graph problems where algorithms are given access to an oracle that predicts (e.g., based on modeling assumptions or on past data) the degrees of nodes…