Online load balancing and network flow

DOI10.1145/167088.167201MaRDI QIDQ5248509zbMATH OpenOpenAlexFDO

Authors Steven J. Phillips, Jeffery R. 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

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

Cited in

(14)

• On-line load balancing
• Scheduling task-trees with additive scales on parallel/distributed machines
• Separation, dimension, and facet algorithms for node flow polyhedra
• Recent developments in maximum flow algorithms
• Competitive routing of virtual circuits with unknown duration
• On-line load balancing of temporary tasks revisited
• 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
• Improved bounds for on-line load balancing
• Tight bounds for selfish and greedy load balancing
• Online unrelated-machine load balancing and generalized flow with recourse
• An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem
• A new algorithm for solving the feasibility problem of a network flow

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

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