Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9888)

Abstract

We show that many distributed network optimization problems can be solved much more efficiently in structured and topologically simple networks.

It is known that solving essentially any global network optimization problem in a general network requires \(\varOmega (\sqrt{n})\) rounds in the CONGEST model, even if the network diameter is small, e.g., logarithmic. Many networks of interest, however, have more structure which allows for significantly more efficient algorithms. Recently Ghaffari, Haeupler, Izumi and Zuzic [SODA’16,PODC’16] introduced low-congestion shortcuts as a suitable abstraction to capture this phenomenon. In particular, they showed that graphs with diameter D embeddable in a genus-g surface have good shortcuts and that these shortcuts lead to \(\tilde{O}(g D)\)-round algorithms for MST, Min-Cut and other problems.

We generalize these results by showing that networks with pathwidth or treewidth k allow for good shortcuts leading to fast \(\tilde{O}(k D)\) distributed optimization algorithms. We also improve the dependence on genus g from \(\tilde{O}(gD)\) to \(\tilde{O}(\sqrt{g}D)\). Lastly, we prove lower bounds which show that the dependence on k and g in our shortcuts is optimal. Overall, this significantly refines and extends the understanding of how the complexity of distributed optimization problems depends on the network topology.

Keywords

Distributed algorithm CONGEST model Treewidth Pathwidth Bounded-genus graph Minimum spanning tree Minimum cut 

Notes

Acknowledgments

We are thankful to the Center for Exploring the Limits of Computation (ELC) and the Japan Society for the Promotion of Science for funding a three-week collaborative research visit. We also thank Mohsen Ghaffari for discussions and contributions at the beginning of this project and the DISC reviewers of this paper for their helpful comments.

References

  1. 1.
    Bodlaender, H.L., Hagerup, T.: Parallel algorithms with optimal speedup for bounded treewidth. SIAM J. Comput. 27(6), 1725–1746 (1998)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Eppstein, D.: Dynamic generators of topologically embedded graphs. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 599–608 (2003)Google Scholar
  3. 3.
    Ghaffari, M., Haeupler, B.: Distributed algorithms for planar networks I: Planar embedding. Manuscript (2015)Google Scholar
  4. 4.
    Ghaffari, M., Haeupler, B.: Distributed algorithms for planar networks II: Low-congestion shortcuts, mst, and min-cut. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 202–219. SIAM (2016)Google Scholar
  5. 5.
    Ghaffari, M., Karrenbauer, A., Kuhn, F., Lenzen, C., Patt-Shamir, B.: Near-optimal distributed maximum flow: Extended abstract. In: The Proceedings of the Int’l Symposium on Prince of District Company (PODC), pp. 81–90 (2015)Google Scholar
  6. 6.
    Haeupler, B., Izumi, T., Zuzic, G.: Low-congestion shortcuts without embedding. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. ACM (2016)Google Scholar
  7. 7.
    Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: The Proceedings of the Int’l Symposium on Prince of District Company (PODC), pp. 60–68 (2005)Google Scholar
  8. 8.
    Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. In: The Proceedings of the Int’l Symposium on Prince of District Company (PODC), pp. 238–251 (1995)Google Scholar
  9. 9.
    Lenzen, C., Oswald, Y.A., Wattenhofer, R.: What can be approximated locally?: case study: dominating sets in planar graphs. In: The Proceedings of the Symposium on Parallel Algorithms and Architectures, pp. 46–54 (2008)Google Scholar
  10. 10.
    Lenzen, C., Patt-Shamir, B.: Fast partial distance estimation and applications. In: The Proceedings of the Int’l Symposium on Prince of District Company (PODC), pp. 153–162 (2015)Google Scholar
  11. 11.
    Nanongkai, D., Su, H.-H.: Almost-tight distributed minimum cut algorithms. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 439–453. Springer, Heidelberg (2014)Google Scholar
  12. 12.
    Peleg, D.: Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia (2000)CrossRefMATHGoogle Scholar
  13. 13.
    Sarma, A.D., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. SIAM J. Comput. 41(5), 1235–1265 (2012)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Carnegie Mellon UniversityPittsburghUSA
  2. 2.Nagoya Institute of TechnologyNagoyaJapan

Personalised recommendations