Document

# On Packing Low-Diameter Spanning Trees

## File

LIPIcs.ICALP.2020.33.pdf
• Filesize: 0.61 MB
• 18 pages

## Cite As

Julia Chuzhoy, Merav Parter, and Zihan Tan. On Packing Low-Diameter Spanning Trees. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 33:1-33:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.ICALP.2020.33

## Abstract

Edge connectivity of a graph is one of the most fundamental graph-theoretic concepts. The celebrated tree packing theorem of Tutte and Nash-Williams from 1961 states that every k-edge connected graph G contains a collection 𝒯 of ⌊k/2⌋ edge-disjoint spanning trees, that we refer to as a tree packing; the diameter of the tree packing 𝒯 is the largest diameter of any tree in 𝒯. A desirable property of a tree packing for leveraging the high connectivity of a graph in distributed communication networks, is that its diameter is low. Yet, despite extensive research in this area, it is still unclear how to compute a tree packing of a low-diameter graph G, whose diameter is sublinear in |V(G)|, or, alternatively, how to show that such a packing does not exist. In this paper, we provide first non-trivial upper and lower bounds on the diameter of tree packing. We start by showing that, for every k-edge connected n-vertex graph G of diameter D, there is a tree packing 𝒯 containing Ω(k) trees, of diameter O((101k log n)^D), with edge-congestion at most 2. Karger’s edge sampling technique demonstrates that, if G is a k-edge connected graph, and G[p] is a subgraph of G obtained by sampling each edge of G independently with probability p = Θ(log n/k), then with high probability G[p] is connected. We extend this result to show that the diameter of G[p] is bounded by O(k^(D(D+1)/2)) with high probability. This immediately gives a tree packing of Ω(k/log n) edge-disjoint trees of diameter at most O(k^(D(D+1)/2)). We also show that these two results are nearly tight for graphs with a small diameter: we show that there are k-edge connected graphs of diameter 2D, such that any packing of k/α trees with edge-congestion η contains at least one tree of diameter Ω((k/(2α η D))^D), for any k,α and η. Additionally, we show that if, for every pair u,v of vertices of a given graph G, there is a collection of k edge-disjoint paths connecting u to v, of length at most D each, then we can efficiently compute a tree packing of size k, diameter O(D log n), and edge-congestion O(log n). Finally, we provide several applications of low-diameter tree packing in the distributed settings of network optimization and secure computation.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Design and analysis of algorithms
##### Keywords
• Spanning tree
• packing
• edge-connectivity

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, and Fabian Kuhn. Tight bounds on vertex connectivity under vertex sampling. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, pages 2006-2018. Society for Industrial and Applied Mathematics, 2015.
2. Keren Censor-Hillel, Mohsen Ghaffari, and Fabian Kuhn. Distributed connectivity decomposition. In ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15-18, 2014, pages 156-165, 2014.
3. Keren Censor-Hillel, Mohsen Ghaffari, and Fabian Kuhn. A new perspective on vertex connectivity. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pages 546-561. Society for Industrial and Applied Mathematics, 2014.
4. Mohit Daga, Monika Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak. Distributed edge connectivity in sublinear time. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 343-354. ACM, 2019.
5. Michal Dory. Distributed approximation of minimum k-edge-connected spanning subgraphs. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, pages 149-158. ACM, 2018.
6. Mohsen Ghaffari. Distributed broadcast revisited: Towards universal optimality. In International Colloquium on Automata, Languages, and Programming, pages 638-649. Springer, 2015.
7. Mohsen Ghaffari. Improved Distributed Algorithms for Fundamental Graph Problems. PhD thesis, MIT, USA, 2017. URL: https://groups.csail.mit.edu/tds/papers/Ghaffari/PhDThesis-Ghaffari.pdf.
8. Mohsen Ghaffari and Bernhard Haeupler. Distributed algorithms for planar networks ii: Low-congestion shortcuts, mst, and min-cut. In Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, pages 202-219. SIAM, 2016.
9. Mohsen Ghaffari and Bernhard Haeupler. Distributed algorithms for planar networks II: low-congestion shortcuts, mst, and min-cut. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 202-219, 2016.
10. Mohsen Ghaffari and Fabian Kuhn. Distributed minimum cut approximation. In International Symposium on Distributed Computing, pages 1-15. Springer, 2013.
11. Mohsen Ghaffari and Krzysztof Nowicki. Faster algorithms for edge connectivity via random out contractions, 2019.
12. Alon Itai and Michael Rodeh. The multi-tree approach to reliability in distributed networks. Information and Computation, 79(1):43-59, 1988.
13. Tomáš Kaiser. A short proof of the tree-packing theorem. Discrete Mathematics, 312(10):1689-1691, 2012.
14. David R Karger. Random sampling in cut, flow, and network design problems. Mathematics of Operations Research, 24(2):383-413, 1999.
15. Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, and Taisuke Izumi. Low-congestion shortcut and graph parameters. In 33rd International Symposium on Distributed Computing (DISC 2019). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
16. Fabian Kuhn. A distributed perspective on graph connectivity and cuts. In 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, Prague, Czech Republic - June 23 - 25, 2014, page 1, 2014.
17. Zvi Lotker, Boaz Patt-Shamir, and David Peleg. Distributed MST for constant diameter graphs. Distributed Computing, 18(6):453-460, 2006.
18. Danupon Nanongkai and Hsin-Hao Su. Almost-tight distributed minimum cut algorithms. In International Symposium on Distributed Computing, pages 439-453. Springer, 2014.
19. CSJA Nash-Williams. Edge-disjoint spanning trees of finite graphs. Journal of the London Mathematical Society, 1(1):445-450, 1961.
20. Merav Parter and Eylon Yogev. Low congestion cycle covers and their applications. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1673-1692. SIAM, 2019.
21. David Peleg. Distributed Computing: A Locality-sensitive Approach. SIAM, 2000.
22. David Pritchard and Ramakrishna Thurimella. Fast computation of small cuts via cycle space sampling. ACM Transactions on Algorithms (TALG), 7(4):46, 2011.
23. Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer. Distributed verification and hardness of distributed approximation. SIAM Journal on Computing, 41(5):1235-1265, 2012.
24. William Thomas Tutte. On the problem of decomposing a graph into n connected factors. Journal of the London Mathematical Society, 1(1):221-230, 1961.
X

Feedback for Dagstuhl Publishing