Distributed algorithms for scheduling on line and tree networks

DOI10.1145/2332432.2332503zbMath1301.68266arXiv1205.1924OpenAlexW1973053408MaRDI QIDQ2933811

Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal

Publication date: 5 December 2014

Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.1924

zbMATH Keywords

schedulingapproximation algorithmunsplittable flow problem

Mathematics Subject Classification ID

Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Approximation algorithms (68W25) Distributed algorithms (68W15) Flows in graphs (05C21)

Related Items (1)

Improved algorithms for resource allocation under varying capacity

This page was built for publication: Distributed algorithms for scheduling on line and tree networks