Online graph algorithms with predictions

DOI10.1137/1.9781611977073.3MaRDI QIDQ6575072zbMATH OpenFDO

Authors Yossi Azar, Debmalya Panigrahi, Noam Touitou

Publication date 19 July 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(10)

• Online unit profit knapsack with predictions
• Mechanism design with predictions for facility location games with candidate locations
• On the complexity of algorithms with predictions for dynamic graph problems
• Online time-windows TSP with predictions
• Boosting double coverage for k-server via imperfect predictions
• Online facility location with weights and congestion
• Mechanism design with predictions for facility location games with candidate locations
• Scheduling with speed predictions
• Online interval scheduling with predictions
• On approximability of _2² min-sum clustering

This page was built for publication: Online graph algorithms with predictions

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