Online load balancing and network flow

DOI10.1145/167088.167201zbMath1310.90019OpenAlexW1998128290MaRDI QIDQ5248509

Steven J. Phillips, Jeffery Westbrook

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Deterministic network models in operations research (90B10) Coloring of graphs and hypergraphs (05C15) Online algorithms; streaming algorithms (68W27) Flows in graphs (05C21)

Related Items (13)

On-line load balancing ⋮ Recent developments in maximum flow algorithms ⋮ Separation, dimension, and facet algorithms for node flow polyhedra ⋮ Scheduling task-trees with additive scales on parallel/distributed machines ⋮ Scheduling task-tree with additive scales on parallel/distributed machines ⋮ Load balancing for response time ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ Tight bounds for selfish and greedy load balancing ⋮ An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem ⋮ Improved bounds for on-line load balancing ⋮ Competitive routing of virtual circuits with unknown duration ⋮ A new algorithm for solving the feasibility problem of a network flow ⋮ On-line load balancing of temporary tasks revisited

This page was built for publication: Online load balancing and network flow