Online two-dimensional load balancing

DOI10.4230/LIPICS.ICALP.2020.34MaRDI QIDQ6842542zbMATH OpenFDO

Authors Ilan Reuven Cohen, Sungjin Im, Debmalya Panigrahi

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2020.34

zbMATH Keywords

multi-dimensionalonline algorithmsscheduling

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• (Incremental) priority algorithms
• A Better Algorithm for an Ancient Scheduling Problem
• A better lower bound for on-line scheduling
• A new approach to online scheduling: approximating the optimal competitive ratio
• A two-phase algorithm for bin stretching with stretching factor 1.5
• An efficient algorithm for bin stretching
• An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
• An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
• Approximation algorithms for NP-hard problems.
• Better Bounds for Online Scheduling
• Bounds on Multiprocessing Timing Anomalies
• Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
• Competitive flow time algorithms for polyhedral scheduling
• Fast algorithms for bin packing
• scientific article; zbMATH DE number 1670659 (Why is no real title available?)
• scientific article; zbMATH DE number 4130003 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• scientific article; zbMATH DE number 1445351 (Why is no real title available?)
• Improved lower bounds for the online bin stretching problem
• New algorithms for an ancient scheduling problem.
• On Multidimensional Packing Problems
• On randomized online scheduling
• On-line bin-stretching
• Online algorithms: a survey
• Online bin packing: old algorithms and new results
• Online bin stretching with bunch techniques
• Online load balancing on related machines
• Online multidimensional load balancing
• Packing small vectors
• Randomized algorithms for online vector load balancing
• Resource constrained scheduling as generalized bin packing
• Semi on-line algorithms for the partition problem
• Semi-online scheduling revisited
• Tight bounds for online vector bin packing
• Tight bounds for online vector scheduling
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: Online two-dimensional load balancing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842542)