Distributed Broadcast Revisited: Towards Universal Optimality

DOI10.1007/978-3-662-47666-6_51zbMath1440.68013OpenAlexW2293762274MaRDI QIDQ3449512

Mohsen Ghaffari

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_51

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Related Items (1)

Distributed CONGEST Algorithms against Mobile Adversaries

Cites Work

• Unnamed Item
• A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
• Distributed connectivity decomposition
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Distributed Computing: A Locality-Sensitive Approach
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• Distributed approximation algorithms for weighted shortest paths
• Fast distributed construction of k-dominating sets and applications
• Distributed verification and hardness of distributed approximation
• Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history

This page was built for publication: Distributed Broadcast Revisited: Towards Universal Optimality