Tight Lower Bounds in the Supported LOCAL Model
Pages 95 - 105
Abstract
In this work, we study the complexity of fundamental distributed graph problems in the recently popular setting where information about the input graph is available to the nodes before the start of the computation. We focus on the most common such setting, known as the Supported LOCAL model, where the input graph---on which the studied graph problem has to be solved---is guaranteed to be a subgraph of the underlying communication network.
Building on a successful lower bound technique for the LOCAL model called round elimination, we develop a framework for proving complexity lower bounds in the stronger Supported LOCAL model. Our framework reduces the task of proving a (deterministic or randomized) lower bound for a given problem Π to the graph-theoretic task of proving non-existence of a solution to another problem Π′ (on a suitable graph) that can be derived from Π in a mechanical manner.
We use the developed framework to obtain substantial---and, in the majority of cases, asymptotically tight---Supported LOCAL lower bounds for a variety of fundamental graph problems, including maximal matching, maximal independent set, ruling sets, arbdefective colorings, and generalizations thereof. In a nutshell, for essentially any major lower bound proved in the LOCAL model in recent years, we prove a similar lower bound in the Supported LOCAL model.
Our framework also gives rise to a new deterministic version of round elimination in the LOCAL model: while, previous to our work, the general round elimination technique required the use of randomness (even for obtaining deterministic lower bounds), our framework allows to obtain deterministic (and therefore via known lifting techniques also randomized) lower bounds in a purely deterministic manner. Previously, such a purely deterministic application of round elimination was only known for the specific problem of sinkless orientation [SOSA'23].
References
[1]
Akanksha Agrawal, John Augustine, David Peleg, and Srikkanth Ramachandran. 2023. Local Recurrent Problems in the SUPPORTED Model. In 27th International Conference on Principles of Distributed Systems, OPODIS 2023, December 6-8, 2023, Tokyo, Japan (LIPIcs, Vol. 286), Alysson Bessani, Xavier Défago, Junya Nakamura, Koichi Wada, and Yukiko Yamauchi (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 22:1--22:19.
[2]
Noga Alon. 2010. On Constant Time Approximation of Parameters of Bounded Degree Graphs. In Property Testing - Current Research and Surveys, Oded Goldreich (Ed.). Lecture Notes in Computer Science, Vol. 6390. Springer, 234--239.
[3]
Alkida Balliu, Thomas Boudier, Sebastian Brandt, and Dennis Olivetti. 2024. Tight Lower Bounds in the Supported LOCAL Model. Technical Report 2405.00825. arXiv. Full version of this paper.
[4]
Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. 2021. Lower Bounds for Maximal Matchings and Maximal Independent Sets. J. ACM 68, 5 (2021), 39:1--39:30.
[5]
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. 2021. Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees. In PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021, Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen (Eds.). ACM, 283--293.
[6]
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. 2022. Distributed Δ-coloring plays hide-and-seek. In STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, Stefano Leonardi and Anupam Gupta (Eds.). ACM, 464--477.
[7]
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. 2023. Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. In Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. SIAM, 2632--2676.
[8]
Alkida Balliu, Sebastian Brandt, and Dennis Olivetti. 2022. Distributed Lower Bounds for Ruling Sets. SIAM J. Comput. 51, 1 (2022), 70--115.
[9]
Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid, Jan Studený, Jukka Suomela, and Jara Uitto. 2023. Sinkless Orientation Made Simple. In 2023 Symposium on Simplicity in Algorithms, SOSA 2023, Florence, Italy, January 23-25, 2023, Telikepalli Kavitha and Kurt Mehlhorn (Eds.). SIAM, 175--191.
[10]
Leonid Barenboim. 2016. Deterministic (Δ+1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks. Journal of ACM 63, 5 (2016), 1--22.
[11]
Sebastian Brandt. 2019. An Automatic Speedup Theorem for Distributed Problems. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019, Peter Robinson and Faith Ellen (Eds.). ACM, 379--388.
[12]
Sebastian Brandt, Yi-Jun Chang, Jan Grebík, Christoph Grunau, Václav Rozhon, and Zoltán Vidnyánszky. 2022. Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. In 13th Innovations in Theoretical Computer Science Conference, ITCS. 29:1--29:26.
[13]
Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, and Jara Uitto. 2016. A lower bound for the distributed Lovász local lemma. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, Daniel Wichs and Yishay Mansour (Eds.). ACM, 479--488.
[14]
Sebastian Brandt and Dennis Olivetti. 2020. Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants. In Proc. 39th ACM Symp. on Principles of Distributed Computing (PODC). 69--78.
[15]
Yi-Jun Chang, Tsvi Kopelowitz, and Seth Pettie. 2019. An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. SIAM J. Comput. 48, 1 (2019), 122--143.
[16]
Sameep Dahal, Francesco D'Amore, Henrik Lievonen, Timothé Picavet, and Jukka Suomela. 2023. Brief Announcement: Distributed Derandomization Revisited. In 37th International Symposium on Distributed Computing, DISC 2023, October 10-12, 2023, L'Aquila, Italy (LIPIcs, Vol. 281). 40:1--40:5.
[17]
Klaus-Tycho Foerster, Juho Hirvonen, Stefan Schmid, and Jukka Suomela. 2019. On the Power of Preprocessing in Decentralized Network Optimization. In 2019 IEEE Conference on Computer Communications, INFOCOM 2019, Paris, France, April 29 - May 2, 2019. IEEE, 1450--1458.
[18]
Klaus-Tycho Foerster, Janne H. Korhonen, Joel Rybicki, and Stefan Schmid. 2019. Does Preprocessing Help under Congestion?. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019, Peter Robinson and Faith Ellen (Eds.). ACM, 259--261.
[19]
Pierre Fraigniaud, Marc Heinrich, and Adrian Kosowski. 2016. Local Conflict Coloring. In Proc. 57th IEEE Symp. on Foundations of Computer Science (FOCS). 625--634.
[20]
Chetan Gupta, Juho Hirvonen, Janne H. Korhonen, Jan Studený, and Jukka Suomela. 2022. Sparse Matrix Multiplication in the Low-Bandwidth Model. In SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, Kunal Agrawal and I-Ting Angelina Lee (Eds.). ACM, 435--444.
[21]
Bernhard Haeupler, David Wajc, and Goran Zuzic. 2021. Universally-optimal distributed algorithms for known topologies. In STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, Samir Khuller and Virginia Vassilevska Williams (Eds.). ACM, 1166--1179.
[22]
Yannic Maus and Tigran Tonoyan. 2020. Local Conflict Coloring Revisited: Linial for Lists. In 34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference (LIPIcs, Vol. 179). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16:1--16:18.
[23]
Stefan Schmid and Jukka Suomela. 2013. Exploiting locality in distributed SDN control. In Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, HotSDN 2013, The Chinese University of Hong Kong, Hong Kong, China, Friday, August 16, 2013, Nate Foster and Rob Sherwood (Eds.). ACM, 121--126.
Index Terms
- Tight Lower Bounds in the Supported LOCAL Model
Recommendations
Node and Edge Averaged Complexities of Local Graph Problems
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingWe continue the recently started line of work on the distributed node-averaged complexity of distributed graph algorithms. The node-averaged complexity of a distributed algorithm running on a graph G=(V,E) is the average over the times at which the ...
Distributed Lower Bounds for Ruling Sets
Given a graph $G=(V,E)$, an $(\alpha,\beta)$-ruling set is a subset $S\subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is at most $\beta$. We ...
Distributed ∆-coloring plays hide-and-seek
STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of ComputingWe prove several new tight or near-tight distributed lower bounds for classic symmetry breaking problems in graphs. As a basic tool, we first provide a new insightful proof that any deterministic distributed algorithm that computes a Δ-coloring on Δ-...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
June 2024
570 pages
ISBN:9798400706684
DOI:10.1145/3662158
- Chair:
- Ran Gelles,
- Proceedings Chair:
- Dennis Olivetti,
- Program Chair:
- Petr Kuznetsov
This work is licensed under a Creative Commons Attribution-NonCommercial International 4.0 License.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 June 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- MUR (Italy)
- PNRR MIUR
- MUR
Conference
Acceptance Rates
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 100Total Downloads
- Downloads (Last 12 months)100
- Downloads (Last 6 weeks)21
Reflects downloads up to 16 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in