arXiv (All)
open access
Dynamic Load Balancing under Restricting Updates
We study the problem of load balancing in the dynamic setting. The input is a bipartite graph $G = (J \cup M, E)$ of jobs $J$ and machines $M$. Every job has a positive weight $w(j)$. The goal is to assign every job in $J$ to an adjacent machine in $M$ so as to minimize the maximum machine load, whe
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
- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
- Consistency-Robustness Tradeoffs for Online Bipartite Allocation with Multiple Stages#1109877
- Fair Stable Matching: A Nash Social Welfare Approach#924243
- Fair Stable Matching: A Nash Social Welfare Approach#920012
- Fair Division of Graphs: Beyond Traceability#799152
Record · ID 1388140
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