Online balanced allocation of dynamic components

DOI10.4230/LIPICS.ITCS.2025.81MaRDI QIDQ7296728zbMATH OpenFDO

Authors Rajmohan Rajaraman, Omer Wasim

Publication date 14 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2025.81

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Competitive Caching with Machine Learned Advice
• Competitive capacitated online recoloring
• Competitive vertex recoloring
• Dynamic balanced graph partitioning
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1303544 (Why is no real title available?)
• scientific article; zbMATH DE number 1559529 (Why is no real title available?)
• scientific article; zbMATH DE number 7788504 (Why is no real title available?)
• Improved analysis of online balanced clustering
• Improved bounds for online balanced graph re-partitioning
• Near-Optimal Bounds for Online Caching with Machine Learned Advice
• On dynamic graph algorithms with predictions

This page was built for publication: Online balanced allocation of dynamic components

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