Online load balancing with general reassignment cost
From MaRDI portal
Publication:2157902
DOI10.1016/J.ORL.2022.03.007OpenAlexW4220945553MaRDI QIDQ2157902FDOQ2157902
Authors: Sebastian Berndt, Franziska Eberle, Nicole Megow 
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
Recommendations
- scientific article; zbMATH DE number 1256657
- Online and Random-order Load Balancing Simultaneously
- Online multidimensional load balancing
- On-line load balancing
- Improved bounds for on-line load balancing
- Online load balancing on uniform machines with limited migration
- Online vector scheduling and generalized load balancing
- On-line load balancing and network flow
- On-line load balancing made simple: greedy strikes back
- Well-behaved online load balancing against strategic jobs
Cites Work
- Network flows. Theory, algorithms, and applications.
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Fully dynamic bin packing revisited
- Dynamic Steiner Tree Problem
- Title not available (Why is that?)
- Fully-dynamic bin packing with little repacking
- Concentration of Measure for the Analysis of Randomized Algorithms
- A robust APTAS for the classical bin packing problem
- Maintaining assignments online: matching, scheduling, and flows
- Better Bounds for Online Scheduling
- Improved Bounds for the Online Scheduling Problem
- Competitive routing of virtual circuits with unknown duration
- Online and dynamic algorithms for set cover
- Online scheduling with bounded migration
- Robust approximation schemes for cube packing
- Robust algorithms for preemptive scheduling
- Load Balancing for Response Time
- 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
- A robust AFPTAS for online bin packing with polynomial migration
- The power of recourse for online MST and TSP
- Online maximum matching with recourse
- Improved bounds for on-line load balancing
- Simultaneously load balancing for every \(p\)-norm, with reassignments
- Online bipartite matching with amortized \(O(\log^2 n)\) replacements
- Title not available (Why is that?)
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching
Cited In (5)
This page was built for publication: Online load balancing with general reassignment cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2157902)
