Online unrelated-machine load balancing and generalized flow with recourse

DOI10.1145/3564246.3585222MaRDI QIDQ6499266zbMATH OpenFDO

Authors Ravishankar Krishnaswamy, Shi Li, Varun Suriyanarayana

Publication date 8 May 2024

Full work available at URL https://doi.org/10.1145/3564246.3585222

zbMATH Keywords

generalized network flowload balancingonline algorithms with recourse

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
• An approximation algorithm for the generalized assignment problem
• Approximation algorithms for scheduling unrelated parallel machines
• Better Bounds for Online Scheduling
• Competitive routing of virtual circuits with unknown duration
• Improved Bounds for the Online Scheduling Problem
• Load Balancing for Response Time
• Maintaining assignments online: matching, scheduling, and flows
• Network flow algorithms
• On-line load balancing
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Online load balancing and network flow
• Online load balancing with general reassignment cost
• Online scheduling with bounded migration
• The Competitiveness of On-Line Assignments

Cited in

(3)

• Low recourse arborescence forests under uniformly random arcs
• Fully-dynamic load balancing
• Fully-dynamic load balancing

This page was built for publication: Online unrelated-machine load balancing and generalized flow with recourse

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