Online unrelated-machine load balancing and generalized flow with recourse

DOI10.1145/3564246.3585222MaRDI QIDQ6499266

Shi Li, Ravishankar Krishnaswamy, Varun Suriyanarayana

Publication date: 8 May 2024

zbMATH Keywords

load balancinggeneralized network flowonline algorithms with recourse

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

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