Faster communication in known topology radio networks
DOI10.1145/1073814.1073840zbMath1314.68155OpenAlexW2048454711MaRDI QIDQ5177234
Qin Xin, Leszek Gąsieniec, David Peleg
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.1073840
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items