On-line load balancing and network flow

DOI10.1007/PL00009214zbMath0899.68047OpenAlexW2083036176MaRDI QIDQ1393068

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

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

Related Items (4)

Simultaneously load balancing for every p-norm, with reassignments ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ On-line load balancing made simple: greedy strikes back ⋮ On-line algorithms for the channel assignment problem in cellular networks.

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