Document Open Access Logo

The Message Complexity of Distributed Graph Optimization

Authors Fabien Dufoulon , Shreyas Pai , Gopal Pandurangan , Sriram V. Pemmaraju , Peter Robinson

PDF
Thumbnail PDF

File

LIPIcs.ITCS.2024.41.pdf
  • Filesize: 1.11 MB
  • 26 pages

Document Identifiers

Author Details

Fabien Dufoulon
  • Lancaster University, UK
Shreyas Pai
  • Aalto University, Finland
Gopal Pandurangan
  • University of Houston, TX, USA
Sriram V. Pemmaraju
  • University of Iowa, IA, USA
Peter Robinson
  • Augusta University, GA, USA

Funding

  • Dufoulon, Fabien: Supported, while a postdoctoral fellow at the University of Houston (in Houston, USA), in part by National Science Foundation (NSF) grants CCF-1540512, IIS-1633720, and CCF-1717075 and U.S.-Israel Binational Science Foundation (BSF) grant 2016419.
  • Pai, Shreyas: Supported in part by Research Council of Finland Grant 334238 and Helsinki Institute for Information Technology HIIT.
  • Pandurangan, Gopal: Supported in part by National Science Foundation (NSF) grants CCF-1540512, IIS-1633720, and CCF-1717075 and U.S.-Israel Binational Science Foundation (BSF) grant 2016419.
  • Pemmaraju, Sriram V.: Partially supported by NSF grant IIS-1955939.

Cite AsGet BibTex

Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, and Peter Robinson. The Message Complexity of Distributed Graph Optimization. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 41:1-41:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ITCS.2024.41

Abstract

The message complexity of a distributed algorithm is the total number of messages sent by all nodes over the course of the algorithm. This paper studies the message complexity of distributed algorithms for fundamental graph optimization problems. We focus on four classical graph optimization problems: Maximum Matching (MaxM), Minimum Vertex Cover (MVC), Minimum Dominating Set (MDS), and Maximum Independent Set (MaxIS). In the sequential setting, these problems are representative of a wide spectrum of hardness of approximation. While there has been some progress in understanding the round complexity of distributed algorithms (for both exact and approximate versions) for these problems, much less is known about their message complexity and its relation with the quality of approximation. We almost fully quantify the message complexity of distributed graph optimization by showing the following results: 1) Cubic regime: Our first main contribution is showing essentially cubic, i.e., Ω̃(n³) lower bounds (where n is the number of nodes in the graph) on the message complexity of distributed exact computation of Minimum Vertex Cover (MVC), Minimum Dominating Set (MDS), and Maximum Independent Set (MaxIS). Our lower bounds apply to any distributed algorithm that runs in polynomial number of rounds (a mild and necessary restriction). Our result is significant since, to the best of our knowledge, this are the first ω(m) (where m is the number of edges in the graph) message lower bound known for distributed computation of such classical graph optimization problems. Our bounds are essentially tight, as all these problems can be solved trivially using O(n³) messages in polynomial rounds. All these bounds hold in the standard CONGEST model of distributed computation in which messages are of O(log n) size. 2) Quadratic regime: In contrast, we show that if we allow approximate computation then Θ̃(n²) messages are both necessary and sufficient. Specifically, we show that Ω̃(n²) messages are required for constant-factor approximation algorithms for all four problems. For MaxM and MVC, these bounds hold for any constant-factor approximation, whereas for MDS and MaxIS they hold for any approximation factor better than some specific constants. These lower bounds hold even in the LOCAL model (in which messages can be arbitrarily large) and they even apply to algorithms that take arbitrarily many rounds. We show that our lower bounds are essentially tight, by showing that if we allow approximation to within an arbitrarily small constant factor, then all these problems can be solved using Õ(n²) messages even in the CONGEST model. 3) Linear regime: We complement the above lower bounds by showing distributed algorithms with Õ(n) message complexity that run in polylogarithmic rounds and give constant-factor approximations for all four problems on random graphs. These results imply that almost linear (in n) message complexity is achievable on almost all (connected) graphs of every edge density.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • Distributed graph algorithm
  • message complexity
  • distributed approximation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Amir Abboud, Keren Censor-Hillel, Seri Khoury, and Christoph Lenzen. Fooling views: A new lower bound technique for distributed computations under congestion. Distrib. Comput., 33(6):545-559, December 2020. URL: https://doi.org/10.1007/s00446-020-00373-4.
  2. Yehuda Afek and Eli Gafni. Time and message bounds for election in synchronous and asynchronous complete networks. SIAM Journal on Computing, 20(2):376-394, 1991. Google Scholar
  3. B. Awerbuch and D. Peleg. Sparse partitions. In Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pages 503-513 vol.2, 1990. URL: https://doi.org/10.1109/FSCS.1990.89571.
  4. Baruch Awerbuch, Oded Goldreich, David Peleg, and Ronen Vainish. A trade-off between information and communication in broadcast protocols. J. ACM, 37(2):238-256, 1990. URL: https://doi.org/10.1145/77600.77618.
  5. Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, and Ami Paz. Hardness of distributed optimization. In PODC, pages 238-247, 2019. URL: https://doi.org/10.1145/3293611.3331597.
  6. Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, and Sriram V. Pemmaraju. Near-Optimal Clustering in the k-machine model. In ICDCN, pages 15:1-15:10, 2018. URL: https://doi.org/10.1145/3154273.3154317.
  7. Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, and Sriram V. Pemmaraju. Near-optimal clustering in the k-machine model. Theor. Comput. Sci., 899:80-97, 2022. URL: https://doi.org/10.1016/J.TCS.2021.11.026.
  8. Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, and Gregory Schwartzman. Distributed approximation of maximum independent set and maximum matching. In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC '17, pages 165-174, New York, NY, USA, 2017. Association for Computing Machinery. URL: https://doi.org/10.1145/3087801.3087806.
  9. Reuven Bar-Yehuda, Keren Censor-Hillel, and Gregory Schwartzman. A distributed (2 + ε)-approximation for vertex cover in O(log Δ / ε log log Δ) rounds. J. ACM, 64(3):23:1-23:11, 2017. URL: https://doi.org/10.1145/3060294.
  10. Leonid Barenboim and Michael Elkin. Distributed Graph Coloring: Fundamentals and Recent Developments. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, 2013. Google Scholar
  11. Leonid Barenboim, Michael Elkin, and Fabian Kuhn. Distributed (Δ+1)-Coloring in Linear (in Δ) Time. SIAM J. Comput., 43(1):72-95, 2014. URL: https://doi.org/10.1137/12088848X.
  12. Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. The Locality of Distributed Symmetry Breaking. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012, pages 321-330, 2012. URL: https://doi.org/10.1109/FOCS.2012.60.
  13. Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. The Locality of Distributed Symmetry Breaking. J. ACM, 63(3):20:1-20:45, 2016. URL: https://doi.org/10.1145/2903137.
  14. Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, and Gregory Schwartzman. A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n log Δ / log²logΔ) Rounds. In Zvi Lotker and Boaz Patt-Shamir, editors, Structural Information and Communication Complexity - 25th International Colloquium, SIROCCO 2018, pages 226-236, 2018. URL: https://doi.org/10.1007/978-3-030-01325-7_21.
  15. Tushar Bisht, Kishore Kothapalli, and Sriram V. Pemmaraju. Brief announcement: Super-fast t-ruling sets. In ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15-18, 2014, pages 379-381. ACM, 2014. URL: https://doi.org/10.1145/2611462.2611512.
  16. Béla Bollobás. Random Graphs. Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2 edition, 2001. URL: https://doi.org/10.1017/CBO9780511814068.
  17. Keren Censor-Hillel and Michal Dory. Distributed spanner approximation. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018, pages 139-148, 2018. URL: https://doi.org/10.1145/3212734.3212758.
  18. Keren Censor-Hillel, Seri Khoury, and Ami Paz. Quadratic and near-quadratic lower bounds for the CONGEST model. In 31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria, pages 10:1-10:16, 2017. URL: https://doi.org/10.4230/LIPIcs.DISC.2017.10.
  19. Ashok K. Chandra, Merrick L. Furst, and Richard J. Lipton. Multi-party protocols. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, STOC '83, pages 94-99, New York, NY, USA, 1983. Association for Computing Machinery. URL: https://doi.org/10.1145/800061.808737.
  20. Yi-Jun Chang, Wenzheng Li, and Seth Pettie. Distributed (Δ+1)-Coloring via ultrafast graph shattering. SIAM Journal on Computing, 49(3):497-539, 2020. URL: https://doi.org/10.1137/19M1249527.
  21. Arkadev Chattopadhyay, Michael Langberg, Shi Li, and Atri Rudra. Tight network topology dependent bounds on rounds of communication. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pages 2524-2539. SIAM, 2017. URL: https://doi.org/10.1137/1.9781611974782.167.
  22. Arkadev Chattopadhyay, Jaikumar Radhakrishnan, and Atri Rudra. Topology matters in communication. In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pages 631-640, 2014. URL: https://doi.org/10.1109/FOCS.2014.73.
  23. Arkadev Chattopadhyay and Atri Rudra. The range of topological effects on communication. In Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, and Bettina Speckmann, editors, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, volume 9135 of Lecture Notes in Computer Science, pages 540-551. Springer, 2015. URL: https://doi.org/10.1007/978-3-662-47666-6_43.
  24. Janosch Deurer, Fabian Kuhn, and Yannic Maus. Deterministic distributed dominating set approximation in the CONGEST model. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC), 2019. Google Scholar
  25. Irit Dinur and Samuel Safra. On the hardness of approximating minimum vertex cover. Annals of Mathematics, 162(1):439-485, 2005. Google Scholar
  26. Irit Dinur and David Steurer. Analytical approach to parallel repetition. In Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, STOC '14, pages 624-633, New York, NY, USA, 2014. Association for Computing Machinery. URL: https://doi.org/10.1145/2591796.2591884.
  27. Andrew Drucker, Fabian Kuhn, and Rotem Oshman. On the Power of the Congested Clique Model. In Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing, PODC '14, pages 367-376, New York, NY, USA, 2014. ACM. URL: https://doi.org/10.1145/2611462.2611493.
  28. Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, and Peter Robinson. The Message Complexity of Distributed Graph Optimization, 2023. URL: https://doi.org/10.48550/arXiv.2311.14811.
  29. P Ďuriš and Pavel Pudlák. On the communication complexity of planarity. In Fundamentals of Computation Theory: International Conference FCT'89 Szeged, Hungary, August 21-25, 1989 Proceedings 7, pages 145-147. Springer, 1989. Google Scholar
  30. Yuval Efron, Ofer Grossman, and Seri Khoury. Beyond alice and bob: Improved inapproximability for maximum independent set in congest. In Proceedings of the 39th Symposium on Principles of Distributed Computing, PODC '20, pages 511-520, New York, NY, USA, 2020. Association for Computing Machinery. URL: https://doi.org/10.1145/3382734.3405702.
  31. M. Elkin. A simple deterministic distributed mst algorithm with near-optimal time and message complexities. J. ACM, 67(2), April 2020. URL: https://doi.org/10.1145/3380546.
  32. P. Erdős and A Rényi. On the existence of a factor of degree one of a connected random graph. Acta Mathematica Academiae Scientiarum Hungaricae, 17:359-368, 1966. URL: https://doi.org/10.1007/BF01894879.
  33. Manuela Fischer. Improved deterministic distributed matching via rounding. Distributed Computing, 33, 2020. URL: https://doi.org/10.1007/s00446-018-0344-4.
  34. Manuela Fischer, Slobodan Mitrović, and Jara Uitto. Deterministic (1+ε)-approximate maximum matching with poly(1/ε) passes in the semi-streaming model and beyond. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, pages 248-260, New York, NY, USA, 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3519935.3520039.
  35. Manuela Fischer and Andreas Noever. Tight analysis of parallel randomized greedy MIS. In SODA, pages 2152-2160, 2018. Google Scholar
  36. Alan Frieze and Colin McDiarmid. Algorithmic theory of random graphs. Random Structures & Algorithms, 10(1-2):5-42, 1997. URL: https://doi.org/10.1002/(SICI)1098-2418(199701/03)10:1/2<5::AID-RSA2>3.0.CO;2-Z.
  37. Mohsen Ghaffari. An improved distributed algorithm for maximal independent set. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’16, pages 270-277, USA, 2016. Society for Industrial and Applied Mathematics. Google Scholar
  38. Mohsen Ghaffari. Distributed maximal independent set using small messages. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 805-820. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.50.
  39. Mohsen Ghaffari and Fabian Kuhn. Derandomizing distributed algorithms with small messages: Spanners and dominating set. In 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018, pages 29:1-29:17, 2018. URL: https://doi.org/10.4230/LIPIcs.DISC.2018.29.
  40. Mohsen Ghaffari, Fabian Kuhn, and Yannic Maus. On the complexity of local distributed graph problems. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pages 784-797, New York, NY, USA, 2017. Association for Computing Machinery. URL: https://doi.org/10.1145/3055399.3055471.
  41. Roman Glebov, Anita Liebenau, and Tibor Szabó. On the concentration of the domination number of the random graph. SIAM Journal on Discrete Mathematics, 29(3):1186-1206, 2015. URL: https://doi.org/10.1137/12090054X.
  42. Ashish Goel, Michael Kapralov, and Sanjeev Khanna. On the communication and streaming complexity of maximum bipartite matching. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, pages 468-485. SIAM, 2012. Google Scholar
  43. Thorsten Götte, Christina Kolb, Christian Scheideler, and Julian Werthmann. Beep-and-sleep: Message and energy efficient set cover. In Algorithms for Sensor Systems: 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, Lisbon, Portugal, September 9–10, 2021, Proceedings, pages 94-110, Berlin, Heidelberg, 2021. Springer-Verlag. URL: https://doi.org/10.1007/978-3-030-89240-1_7.
  44. G. R. Grimmett and C. J. H. McDiarmid. On colouring random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, 77(2):313-324, 1975. URL: https://doi.org/10.1017/S0305004100051124.
  45. Thorsten Götte, Christina Kolb, Christian Scheideler, and Julian Werthmann. Beep-and-sleep: Message and energy efficient set cover. Theoretical Computer Science, 950:113756, 2023. URL: https://doi.org/10.1016/j.tcs.2023.113756.
  46. András Hajnal, Wolfgang Maass, and György Turán. On the communication complexity of graph properties. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC '88, pages 186-191, New York, NY, USA, 1988. Association for Computing Machinery. URL: https://doi.org/10.1145/62212.62228.
  47. Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, and Tigran Tonoyan. Efficient randomized distributed coloring in congest. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, pages 1180-1193, New York, NY, USA, 2021. Association for Computing Machinery. URL: https://doi.org/10.1145/3406325.3451089.
  48. James W. Hegeman, Gopal Pandurangan, Sriram V. Pemmaraju, Vivek B. Sardeshmukh, and Michele Scquizzato. Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, pages 91-100, New York, NY, USA, 2015. ACM. URL: https://doi.org/10.1145/2767386.2767434.
  49. James W. Hegeman and Sriram V. Pemmaraju. Lessons from the congested clique applied to mapreduce. Theor. Comput. Sci., 608:268-281, 2015. URL: https://doi.org/10.1016/j.tcs.2015.09.029.
  50. Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, and Qin Zhang. Communication Complexity of Approximate Matching in Distributed Graphs. In Ernst W. Mayr and Nicolas Ollinger, editors, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), volume 30 of Leibniz International Proceedings in Informatics (LIPIcs), pages 460-473, Dagstuhl, Germany, 2015. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. URL: https://doi.org/10.4230/LIPIcs.STACS.2015.460.
  51. Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, and Ronald de Wolf. New bounds on the classical and quantum communication complexity of some graph properties. In Deepak D'Souza, Telikepalli Kavitha, and Jaikumar Radhakrishnan, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, volume 18 of LIPIcs, pages 148-159. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2012.148.
  52. Lujun Jia, Rajmohan Rajaraman, and Torsten Suel. An efficient distributed algorithm for constructing small dominating sets. Distributed Computing, 15(4):193-205, 2002. URL: https://doi.org/10.1007/s00446-002-0078-0.
  53. Valerie King, Shay Kutten, and Mikkel Thorup. Construction and impromptu repair of an mst in a distributed network with o(m) communication. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, pages 71-80, New York, NY, USA, 2015. ACM. URL: https://doi.org/10.1145/2767386.2767405.
  54. Naoki Kitamura and Taisuke Izumi. A subquadratic-time distributed algorithm for exact maximum matching. IEICE Transactions on Information and Systems, E105.D(3):634-645, 2022. URL: https://doi.org/10.1587/transinf.2021EDP7083.
  55. Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, and Peter Robinson. Distributed computation of large-scale graph problems. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 391-410. SIAM, 2015. URL: https://doi.org/10.1137/1.9781611973730.28.
  56. E. Korach, S. Moran, and S. Zaks. The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors. SIAM J. Comput., 16(2):231-236, 1987. URL: https://doi.org/10.1137/0216019.
  57. Kishore Kothapalli and Sriram V. Pemmaraju. Super-fast 3-ruling sets. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, volume 18 of LIPIcs, pages 136-147, 2012. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2012.136.
  58. Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. What cannot be computed locally! In Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC ’04, pages 300-309, New York, NY, USA, 2004. Association for Computing Machinery. URL: https://doi.org/10.1145/1011767.1011811.
  59. Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. Local computation: Lower and upper bounds. J. ACM, 63(2), 2016. URL: https://doi.org/10.1145/2742012.
  60. Eyal Kushilevitz and Noam Nisan. Communication Complexity. Cambridge University Press, New York, NY, USA, 1997. Google Scholar
  61. Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, and Amitabh Trehan. On the complexity of universal leader election. J. ACM, 62(1):7:1-7:27, 2015. Google Scholar
  62. Nathan Linial and Michael Saks. Low diameter graph decompositions. Combinatorica, 13, 1993. URL: https://doi.org/10.1007/BF01303516.
  63. Zvi Lotker, Boaz Patt-Shamir, Elan Pavlov, and David Peleg. Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds. SIAM Journal on Computing, 35(1):120-131, 2005. Google Scholar
  64. Zvi Lotker, Boaz Patt-Shamir, and Seth Pettie. Improved distributed approximate matching. J. ACM, 62(5), November 2015. URL: https://doi.org/10.1145/2786753.
  65. Gary L. Miller, Richard Peng, and Shen Chen Xu. Parallel graph decompositions using random shifts. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '13, pages 196-203, New York, NY, USA, 2013. Association for Computing Machinery. URL: https://doi.org/10.1145/2486159.2486180.
  66. Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, and Peter Robinson. Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. In DISC, pages 38:1-38:16, 2017. URL: https://doi.org/10.4230/LIPIcs.DISC.2017.38.
  67. Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, and Peter Robinson. Can we break symmetry with o(m) communication? In Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen, editors, PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021, pages 247-257. ACM, 2021. URL: https://doi.org/10.1145/3465084.3467909.
  68. Saurav Pandit and Sriram V. Pemmaraju. Rapid randomized pruning for fast greedy distributed algorithms. In Andréa W. Richa and Rachid Guerraoui, editors, Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pages 325-334. ACM, 2010. URL: https://doi.org/10.1145/1835698.1835777.
  69. Gopal Pandurangan, David Peleg, and Michele Scquizzato. Message lower bounds via efficient network synchronization. Theoretical Computer Science, 810:82-95, 2020. Special issue on Structural Information and Communication Complexity. URL: https://doi.org/10.1016/j.tcs.2018.11.017.
  70. Gopal Pandurangan, Peter Robinson, and Michele Scquizzato. A time- and message-optimal distributed algorithm for minimum spanning trees. ACM Trans. Algorithms, 16(1):13:1-13:27, 2020. URL: https://doi.org/10.1145/3365005.
  71. Gopal Pandurangan, Peter Robinson, and Michele Scquizzato. On the distributed complexity of large-scale graph computations. ACM Trans. Parallel Comput., 8(2):7:1-7:28, 2021. URL: https://doi.org/10.1145/3460900.
  72. Boaz Patt-Shamir and Mor Perry. Proof-labeling schemes: Broadcast, unicast and in between. In Stabilization, Safety, and Security of Distributed Systems - 19th International Symposium, SSS 2017, Boston, MA, USA, November 5-8, 2017, Proceedings, pages 1-17, 2017. URL: https://doi.org/10.1007/978-3-319-69084-1_1.
  73. David Peleg. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, 2000. Google Scholar
  74. Anup Rao and Amir Yehudayoff. Communication Complexity: and Applications. Cambridge University Press, 2020. URL: https://doi.org/10.1017/9781108671644.
  75. Alexander A. Razborov. On the distributional complexity of disjointness. Theor. Comput. Sci., 106(2):385-390, 1992. URL: https://doi.org/10.1016/0304-3975(92)90260-M.
  76. Václav Rozhoň and Mohsen Ghaffari. Polylogarithmic-time deterministic network decomposition and distributed derandomization. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages 350-363, 2020. Google Scholar
  77. Prasoon Tiwari. Lower bounds on communication complexity in distributed computer networks. J. ACM, 34(4):921-938, October 1987. URL: https://doi.org/10.1145/31846.32978.
  78. Vijay V. Vazirani. Approximation Algorithms. Springer-Verlag, Berlin, Heidelberg, 2001. Google Scholar
  79. Ben Wieland and Anant P. Godbole. On the domination number of a random graph. The Electronic Journal of Combinatorics [electronic only], 8, 2001. URL: http://eudml.org/doc/121890.
  80. David P. Woodruff and Qin Zhang. When distributed computation is communication expensive. Distributed Comput., 30(5):309-323, 2017. URL: https://doi.org/10.1007/s00446-014-0218-3.
  81. Andrew Chi-Chih Yao. Some complexity questions related to distributive computing(preliminary report). In Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC '79, pages 209-213, New York, NY, USA, 1979. ACM. URL: https://doi.org/10.1145/800135.804414.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact