On dynamic graph algorithms with predictions

DOI10.1137/1.9781611977912.126MaRDI QIDQ6645492zbMATH OpenFDO

Authors Jan van Den Brand, Sebastian Forster, Yasamin Nazari, Adam G. Polak

Publication date 28 November 2024

Full work available at URL https://doi.org/10.1137/1.9781611977912.126

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• Learning-augmented maximum independent set
• Boosting double coverage for k-server via imperfect predictions
• Connectivity oracles for predictable vertex failures
• Learning-augmented streaming algorithms for approximating MAX-CUT
• Online balanced allocation of dynamic components
• Incremental approximate single-source shortest paths with predictions

This page was built for publication: On dynamic graph algorithms with predictions

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