@inproceedings{3888783138904b3a882f826333230d34,
title = "Message reduction in the LOCAL model is a free lunch",
abstract = "A new spanner construction algorithm is presented, working under the LOCAL model with unique edge IDs. Given an n-node communication graph, a spanner with a constant stretch and O(n1+ε) edges (for an arbitrarily small constant ε > 0) is constructed in a constant number of rounds sending O(n1+ε) messages whp. Consequently, we conclude that every t-round LOCAL algorithm can be transformed into an O(t)-round LOCAL algorithm that sends O(t · n1+ε) messages whp. This improves upon all previous message-reduction schemes for LOCAL algorithms that incur a logΩ(1) n blow-up of the round complexity.",
keywords = "Distributed graph algorithms, LOCAL model, Message complexity, Spanner",
author = "Shimon Bitton and Yuval Emek and Taisuke Izumi and Shay Kutten",
note = "Publisher Copyright: {\textcopyright} Shimon Bitton, Yuval Emek, Taisuke Izumi, and Shay Kutten.; 33rd International Symposium on Distributed Computing, DISC 2019 ; Conference date: 14-10-2019 Through 18-10-2019",
year = "2019",
month = oct,
doi = "10.4230/LIPIcs.DISC.2019.7",
language = "אנגלית",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
editor = "Jukka Suomela",
booktitle = "33rd International Symposium on Distributed Computing, DISC 2019",
}