Conference
Distributed algorithms for low stretch spanning trees
| Τίτλος: | Distributed algorithms for low stretch spanning trees |
|---|---|
| Συγγραφείς: | Becker R., Emek Y., Ghaffari M., Lenzen C. |
| Συνεισφορές: | Becker, R., Emek, Y., Ghaffari, M., Lenzen, C. |
| Στοιχεία εκδότη: | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| Έτος έκδοσης: | 2019 |
| Συλλογή: | Università Ca’ Foscari Venezia: ARCA (Archivio Istituzionale della Ricerca) |
| Θεματικοί όροι: | Ball decomposition, CONGEST model, Distributed graph algorithm, Low-stretch spanning tree, Star decomposition, Settore INF/01 - Informatica |
| Περιγραφή: | Given an undirected graph with integer edge lengths, we study the problem of approximating the distances in the graph by a spanning tree based on the notion of stretch. Our main contribution is a distributed algorithm in the CONGEST model of computation that constructs a random spanning tree with the guarantee that the expected stretch of every edge is O(log3 n), where n is the number of nodes in the graph. If the graph is unweighted, then this algorithm can be implemented to run in O(D) rounds, where D is the hop-diameter of the graph, thus being asymptotically optimal. In the weighted case, the run-time of our algorithm matches the currently best known bound for exact distance computations, i.e., Õ(min{√nD, √nD1/4 + n3/5 + D}). We stress that this is the first distributed construction of spanning trees leading to poly-logarithmic expected stretch with non-trivial running time. |
| Τύπος εγγράφου: | conference object |
| Γλώσσα: | English |
| Relation: | ispartofbook:Leibniz International Proceedings in Informatics, LIPIcs; 33rd International Symposium on Distributed Computing, DISC 2019; volume:146; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; https://hdl.handle.net/10278/5029572 |
| DOI: | 10.4230/LIPIcs.DISC.2019.4 |
| Διαθεσιμότητα: | https://hdl.handle.net/10278/5029572 https://doi.org/10.4230/LIPIcs.DISC.2019.4 |
| Rights: | info:eu-repo/semantics/openAccess |
| Αριθμός Καταχώρησης: | edsbas.61FF925 |
| Βάση Δεδομένων: | BASE |
| DOI: | 10.4230/LIPIcs.DISC.2019.4 |
|---|