On-line load balancing and network flow

DOI10.1007/PL00009214MaRDI QIDQ1393068zbMATH OpenOpenAlexFDO

Authors D. Massart

Publication date 1 November 1998

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00009214

zbMATH Keywords

network flowon-line load balancing with preemption

Mathematics Subject Classification ID

Theory of operating systems (68N25) Parallel algorithms in computer science (68W10)

Recommendations

• Improved bounds for on-line load balancing
• scientific article; zbMATH DE number 1256657
• On-line load balancing
• Load Balancing for Response Time

Cited in

(9)

• On-line algorithms for the channel assignment problem in cellular networks.
• Online load balancing with general reassignment cost
• Online and Random-order Load Balancing Simultaneously
• Simultaneously load balancing for every p-norm, with reassignments
• Maintaining assignments online: matching, scheduling, and flows
• A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
• Fully-dynamic load balancing
• Fully-dynamic load balancing
• On-line load balancing made simple: greedy strikes back

This page was built for publication: On-line load balancing and network flow

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