scientific article; zbMATH DE number 7829331

DOI10.4230/LIPICS.ITCS.2022.99MaRDI QIDQ6126344zbMATH OpenFDO

Authors Alexander Lindermayr, Nicole Megow, Bertrand Simon

Publication date 9 April 2024

Full work available at URL https://arxiv.org/abs/2103.01640

zbMATH Keywords

competitive analysisconsistencylearning-augmented algorithmsonline \(k\)-server problemrobustnessuntrusted predictions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(2)

• Boosting double coverage for k-server via imperfect predictions
• Learning-augmented query policies for minimum spanning tree with uncertainty

This page was built for publication:

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