Image de couverture de livre

Improved Online Load Balancing in the Two-Norm

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Borst, Sander, Kashaev, Danish
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Matching on $3$-Uniform Hypergraphs
par: Borst, Sander, et autres
Publié: (2024)

A nearly optimal randomized algorithm for explorable heap selection
par: Borst, Sander, et autres
Publié: (2022)

Selfish, Local and Online Scheduling via Vector Fitting
par: Kashaev, Danish
Publié: (2025)

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs
par: Borst, Sander, et autres
Publié: (2025)

Beyond the Half-Approximation: Fair and Efficient Online Class Matching
par: Borst, Sander, et autres
Publié: (2026)

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
par: Borst, Sander, et autres
Publié: (2024)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
par: Blankenburg, Daniel, et autres
Publié: (2025)

Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
par: Kesselheim, Thomas, et autres
Publié: (2025)

Load Balancing with Duration Predictions
par: Azar, Yossi, et autres
Publié: (2025)

History-Independent Load Balancing
par: Bender, Michael A., et autres
Publié: (2026)

Online Graph Balancing and the Power of Two Choices
par: Bansal, Nikhil, et autres
Publié: (2026)

Streaming and Communication Complexity of Load-Balancing via Matching Contractors
par: Assadi, Sepehr, et autres
Publié: (2024)

Improved Online Sorting
par: Nirjhor, Jubayer, et autres
Publié: (2025)

Balancing Two-Dimensional Straight-Line Programs
par: Boneh, Itai, et autres
Publié: (2025)

Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model
par: Räcke, Harald, et autres
Publié: (2024)

Improved Approximation Algorithm for Maximum Balanced Biclique
par: Manurangsi, Pasin
Publié: (2026)

Online Load and Graph Balancing for Random Order Inputs
par: Im, Sungjin, et autres
Publié: (2024)

Improved Online Reachability Preservers
par: Bodwin, Greg, et autres
Publié: (2024)

Balancing the Spread of Two Opinions in Sparse Social Networks
par: Knop, Dušan, et autres
Publié: (2021)

Supermodular Approximation of Norms and Applications
par: Kesselheim, Thomas, et autres
Publié: (2024)

How to Balance the Load Online When Jobs and Machines Are Both Selfish?
par: Wang, Wenqian, et autres
Publié: (2024)

Minimizing $\ell_2$ Norm of Flow Time by Starvation Mitigation
par: Kuo, Tung-Wei
Publié: (2021)

Simultaneously Approximating All Norms for Massively Parallel Correlation Clustering
par: Cao, Nairen, et autres
Publié: (2024)

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
par: Kaul, Matthias, et autres
Publié: (2025)

New Results on a General Class of Minimum Norm Optimization Problems
par: Chen, Kuowen, et autres
Publié: (2025)

FPT Approximations for Fair Sum of Radii with Outliers and General Norm Objectives
par: Gadekar, Ameet
Publié: (2026)

Improved and Parameterized Algorithms for Online Multi-level Aggregation: A Memory-based Approach
par: Turoczy, Alexander, et autres
Publié: (2025)

Concurrent Balanced Augmented Trees
par: Wrench, Evan, et autres
Publié: (2026)

Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization
par: Nikolov, Aleksandar, et autres
Publié: (2026)

Entrywise Low-Rank Approximation and Matrix $p \rightarrow q$ Norms via Global Correlation Rounding
par: Anderson, Prashanti, et autres
Publié: (2026)

Online Two-Stage Submodular Maximization
par: Nikolaou, Iasonas, et autres
Publié: (2025)

Online Algorithms for Repeated Optimal Stopping: Balancing Baseline Guarantees and Regret
par: Harada, Tsubasa, et autres
Publié: (2025)

Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General
par: Shmoys, David, et autres
Publié: (2026)

Hardness and Approximation Algorithms for Balanced Districting Problems
par: Dharangutte, Prathamesh, et autres
Publié: (2025)

Finding the Balance Rate of Uncertain Signed Graphs
par: Wang, Zeyu, et autres
Publié: (2026)

Balancing Weights, Directed Sparsification, and Augmenting Paths
par: Li, Jason
Publié: (2026)

Dominating Set with Quotas: Balancing Coverage and Constraints
par: Chatterjee, Sobyasachi, et autres
Publié: (2026)

Online Metric TSP
par: Bertram, Christian
Publié: (2025)

Online String Attractors
par: Whittington, Philip
Publié: (2024)

Online Unbounded Knapsack
par: Böckenhauer, Hans-Joachim, et autres
Publié: (2024)