Traversing Layered Graphs Using the Work Function Algorithm

DOI10.1006/jagm.1996.0024zbMath0845.68051OpenAlexW1979235091MaRDI QIDQ4881405

W. R. Burley

Publication date: 9 June 1996

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1996.0024

zbMATH Keywords

work function algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (10)

Randomized algorithms for metrical task systems ⋮ The \(K\)-server problem via a modern optimization lens ⋮ Nested convex bodies are chaseable ⋮ Parametrized Metrical Task Systems ⋮ Metrical service systems with multiple servers ⋮ Randomized algorithms for metrical task systems ⋮ Better Bounds for Online Line Chasing ⋮ Competitive Algorithms for Layered Graph Traversal ⋮ On list update and work function algorithms. ⋮ The 3-server problem in the plane.

This page was built for publication: Traversing Layered Graphs Using the Work Function Algorithm