Fully-dynamic load balancing

DOI10.1007/978-3-031-59835-7_14MaRDI QIDQ7030562zbMATH OpenFDO

Authors Ayoub Foussoul, Vineet Goyal, Amit Kumar

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-59835-7_14

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites work

• Chasing positive bodies
• Dynamic coloring of unit interval graphs with limited recourse budget
• Dynamic Steiner Tree Problem
• Fully-dynamic bin packing with little repacking
• scientific article; zbMATH DE number 2185626 (Why is no real title available?)
• Improved bounds for on-line load balancing
• Improved Bounds for the Online Scheduling Problem
• Maintaining assignments online: matching, scheduling, and flows
• On-line load balancing
• On-line load balancing and network flow
• On-Line Load Balancing of Temporary Tasks
• On-line scheduling revisited
• Online and dynamic algorithms for set cover
• Online perfect matching and mobile computing
• Online scheduling with bounded migration
• Online unrelated-machine load balancing and generalized flow with recourse
• The Competitiveness of On-Line Assignments
• The power of deferral: maintaining a constant-competitive Steiner tree online
• The power of recourse for online MST and TSP

Cited in

(1)

• Robust scheduling on uniform machines. New results using a relaxed approximation guarantee

This page was built for publication: Fully-dynamic load balancing

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