Online load balancing with general reassignment cost
From MaRDI portal
Publication:2157902
DOI10.1016/j.orl.2022.03.007OpenAlexW4220945553MaRDI QIDQ2157902
Nicole Megow, Sebastian Berndt, Franziska Eberle
Publication date: 22 July 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2022.03.007
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust algorithms for preemptive scheduling
- Online maximum matching with recourse
- A robust APTAS for the classical bin packing problem
- Improved bounds for on-line load balancing
- Fully dynamic bin packing revisited
- Robust Approximation Schemes for Cube Packing
- Online Scheduling with Bounded Migration
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
- The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
- Dynamic Steiner Tree Problem
- Better Bounds for Online Scheduling
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Simultaneously load balancing for every p-norm, with reassignments
- Improved Bounds for the Online Scheduling Problem
- Load Balancing for Response Time
- Online and dynamic algorithms for set cover
- Fully-Dynamic Bin Packing with Little Repacking
- Online Bipartite Matching with Amortized O (log 2 n ) Replacements
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration
- Maintaining Assignments Online: Matching, Scheduling, and Flows
- The Power of Recourse for Online MST and TSP
- Concentration of Measure for the Analysis of Randomized Algorithms
- Competitive routing of virtual circuits with unknown duration
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching
This page was built for publication: Online load balancing with general reassignment cost
