Cover Image

Load Balancing with Duration Predictions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Azar, Yossi, Buchbinder, Niv, Epshtein, Tomer
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Trading Prophets with Initial Capital
by: Azar, Yossi, et al.
Published: (2025)

Competitive Bundle Trading
by: Azar, Yossi, et al.
Published: (2025)

Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
by: Buchbinder, Niv, et al.
Published: (2025)

Competitively Consistent Clustering
by: Buchbinder, Niv, et al.
Published: (2025)

Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs
by: Azar, Yossi, et al.
Published: (2025)

Chasing Positive Bodies
by: Bhattacharya, Sayan, et al.
Published: (2023)

Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
by: Buchbinder, Niv, et al.
Published: (2026)

Nearly Tight Bounds for the Online Sorting Problem
by: Azar, Yossi, et al.
Published: (2025)

List Update with Delays or Time Windows
by: Azar, Yossi, et al.
Published: (2023)

History-Independent Load Balancing
by: Bender, Michael A., et al.
Published: (2026)

Improved Online Load Balancing in the Two-Norm
by: Borst, Sander, et al.
Published: (2025)

Streaming and Communication Complexity of Load-Balancing via Matching Contractors
by: Assadi, Sepehr, et al.
Published: (2024)

Tight simulation of a distribution using conditional samples
by: Adar, Tomer
Published: (2025)

Instance-optimal estimation of L2-norm
by: Adar, Tomer
Published: (2026)

Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
by: Kesselheim, Thomas, et al.
Published: (2025)

An $α$-regret analysis of Adversarial Bilateral Trade
by: Azar, Yossi, et al.
Published: (2022)

Almost-Uniform Edge Sampling: Leveraging Independent-Set and Local Graph Queries
by: Adar, Tomer, et al.
Published: (2026)

Refining the Adaptivity Notion in the Huge Object Model
by: Adar, Tomer, et al.
Published: (2023)

Renting Servers in the Cloud: The Case of Equal Duration Jobs
by: Masoori, Mahtab, et al.
Published: (2021)

Aleph Filter: To Infinity in Constant Time
by: Dayan, Niv, et al.
Published: (2024)

Optimal mass estimation in the conditional sampling model
by: Adar, Tomer, et al.
Published: (2025)

Improved Bounds for High-Dimensional Equivalence and Product Testing using Subcube Queries
by: Adar, Tomer, et al.
Published: (2024)

When Local and Non-Local Meet: Quadratic Improvement for Edge Estimation with Independent Set Queries
by: Adar, Tomer, et al.
Published: (2026)

Support Testing in the Huge Object Model
by: Adar, Tomer, et al.
Published: (2023)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
by: Blankenburg, Daniel, et al.
Published: (2025)

Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate $k$-clique counts faster
by: Censor-Hillel, Keren, et al.
Published: (2025)

Fast Approximate Counting of Cycles
by: Censor-Hillel, Keren, et al.
Published: (2024)

From Donkeys to Kings in Tournaments
by: Abboud, Amir, et al.
Published: (2024)

Witness-Sensitive Detection of Induced Diamonds
by: Censor-Hillel, Keren, et al.
Published: (2026)

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment
by: Ezra, Tomer, et al.
Published: (2024)

Concurrent Balanced Augmented Trees
by: Wrench, Evan, et al.
Published: (2026)

Hardness and Approximation Algorithms for Balanced Districting Problems
by: Dharangutte, Prathamesh, et al.
Published: (2025)

Balancing Two-Dimensional Straight-Line Programs
by: Boneh, Itai, et al.
Published: (2025)

Finding the Balance Rate of Uncertain Signed Graphs
by: Wang, Zeyu, et al.
Published: (2026)

Improved Approximation Algorithm for Maximum Balanced Biclique
by: Manurangsi, Pasin
Published: (2026)

Balancing Weights, Directed Sparsification, and Augmenting Paths
by: Li, Jason
Published: (2026)

Dominating Set with Quotas: Balancing Coverage and Constraints
by: Chatterjee, Sobyasachi, et al.
Published: (2026)

Balancing the Spread of Two Opinions in Sparse Social Networks
by: Knop, Dušan, et al.
Published: (2021)

Probabilistic AVL Trees (p-AVL): Relaxing Deterministic Balancing
by: Desikan, Hayagriv
Published: (2026)

Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model
by: Räcke, Harald, et al.
Published: (2024)