arXiv (All)
open access
Improved Online Load Balancing in the Two-Norm
We study the online load balancing problem on unrelated machines, with the objective of minimizing the square of the $\ell_2$ norm of the loads on the machines. The greedy algorithm of Awerbuch et al. (STOC'95) is optimal for deterministic algorithms and achieves a competitive ratio of $3 + 2 \sqrt{
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Dense Interprocedural Dominance in Acyclic Graphs: Context Bounds and Compact Queries#1064362
- Liouville Type Results for Quasilinear Elliptic Inequalities Involving Gradient Terms on Weighted Graphs#1194237
- Democracy Needs Reach: Political Equality, Online Speech, and Algorithmic Recommendation#987209
- Load Balancing Under Adaptive Bin Deletions / Haim Kaplan, Shay Sapir, Uri Stemmer#1188572
- D4a.2 Further exploration of balancing options and system design#313944
Record · ID 1402983
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive