Competitive weighted throughput analysis of greedy protocols on DAGs
From MaRDI portal
Publication:5177245
DOI10.1145/1073814.1073856zbMath1314.68042OpenAlexW2008172931MaRDI QIDQ5177245
Publication date: 10 March 2015
Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1073814.1073856
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Directed graphs (digraphs), tournaments (05C20) Network protocols (68M12) Distributed algorithms (68W15)
This page was built for publication: Competitive weighted throughput analysis of greedy protocols on DAGs
