Conference
Προβολή σε EDS

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
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://hdl.handle.net/10278/5029572#
    Name: EDS - BASE (ns324271)
    Category: fullText
    Text: View record from BASE
Header DbId: edsbas
DbLabel: BASE
An: edsbas.61FF925
RelevancyScore: 898
AccessLevel: 3
PubType: Conference
PubTypeId: conference
PreciseRelevancyScore: 898.215454101563
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Distributed algorithms for low stretch spanning trees
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Becker+R%2E%22">Becker R.</searchLink><br /><searchLink fieldCode="AR" term="%22Emek+Y%2E%22">Emek Y.</searchLink><br /><searchLink fieldCode="AR" term="%22Ghaffari+M%2E%22">Ghaffari M.</searchLink><br /><searchLink fieldCode="AR" term="%22Lenzen+C%2E%22">Lenzen C.</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: Becker, R.<br />Emek, Y.<br />Ghaffari, M.<br />Lenzen, C.
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2019
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: Università Ca’ Foscari Venezia: ARCA (Archivio Istituzionale della Ricerca)
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Ball+decomposition%22">Ball decomposition</searchLink><br /><searchLink fieldCode="DE" term="%22CONGEST+model%22">CONGEST model</searchLink><br /><searchLink fieldCode="DE" term="%22Distributed+graph+algorithm%22">Distributed graph algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22Low-stretch+spanning+tree%22">Low-stretch spanning tree</searchLink><br /><searchLink fieldCode="DE" term="%22Star+decomposition%22">Star decomposition</searchLink><br /><searchLink fieldCode="DE" term="%22Settore+INF%2F01+-+Informatica%22">Settore INF/01 - Informatica</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: 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.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: conference object
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: 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
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.4230/LIPIcs.DISC.2019.4
– Name: URL
  Label: Availability
  Group: URL
  Data: https://hdl.handle.net/10278/5029572<br />https://doi.org/10.4230/LIPIcs.DISC.2019.4
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: info:eu-repo/semantics/openAccess
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.61FF925
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.61FF925
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.4230/LIPIcs.DISC.2019.4
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Ball decomposition
        Type: general
      – SubjectFull: CONGEST model
        Type: general
      – SubjectFull: Distributed graph algorithm
        Type: general
      – SubjectFull: Low-stretch spanning tree
        Type: general
      – SubjectFull: Star decomposition
        Type: general
      – SubjectFull: Settore INF/01 - Informatica
        Type: general
    Titles:
      – TitleFull: Distributed algorithms for low stretch spanning trees
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Becker R.
      – PersonEntity:
          Name:
            NameFull: Emek Y.
      – PersonEntity:
          Name:
            NameFull: Ghaffari M.
      – PersonEntity:
          Name:
            NameFull: Lenzen C.
      – PersonEntity:
          Name:
            NameFull: Becker, R.
      – PersonEntity:
          Name:
            NameFull: Emek, Y.
      – PersonEntity:
          Name:
            NameFull: Ghaffari, M.
      – PersonEntity:
          Name:
            NameFull: Lenzen, C.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2019
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
ResultId 1