Distributed Approximation of Minimum Routing Cost Trees. Hochuli, A., Holzer, S., & Wattenhofer, R. In Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings, volume 8576, of Lecture Notes in Computer Science, pages 121–136, 2014. Springer. Paper doi bibtex @inproceedings{DBLP:conf/sirocco/HochuliHW14,
author = {Alexandra Hochuli and
Stephan Holzer and
Roger Wattenhofer},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Distributed Approximation of Minimum Routing Cost Trees},
booktitle = {Structural Information and Communication Complexity - 21st International
Colloquium, {SIROCCO} 2014, Takayama, Japan, July 23-25, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8576},
pages = {121--136},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09620-9\_11},
doi = {10.1007/978-3-319-09620-9\_11},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/HochuliHW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"mq6c6GGYSBEEqM8wQ","bibbaseid":"hochuli-holzer-wattenhofer-distributedapproximationofminimumroutingcosttrees-2014","authorIDs":[],"author_short":["Hochuli, A.","Holzer, S.","Wattenhofer, R."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Alexandra"],"propositions":[],"lastnames":["Hochuli"],"suffixes":[]},{"firstnames":["Stephan"],"propositions":[],"lastnames":["Holzer"],"suffixes":[]},{"firstnames":["Roger"],"propositions":[],"lastnames":["Wattenhofer"],"suffixes":[]}],"editor":[{"firstnames":["Magnús","M."],"propositions":[],"lastnames":["Halldórsson"],"suffixes":[]}],"title":"Distributed Approximation of Minimum Routing Cost Trees","booktitle":"Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings","series":"Lecture Notes in Computer Science","volume":"8576","pages":"121–136","publisher":"Springer","year":"2014","url":"https://doi.org/10.1007/978-3-319-09620-9_11","doi":"10.1007/978-3-319-09620-9_11","timestamp":"Tue, 14 May 2019 10:00:55 +0200","biburl":"https://dblp.org/rec/conf/sirocco/HochuliHW14.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/sirocco/HochuliHW14,\n author = {Alexandra Hochuli and\n Stephan Holzer and\n Roger Wattenhofer},\n editor = {Magn{\\'{u}}s M. Halld{\\'{o}}rsson},\n title = {Distributed Approximation of Minimum Routing Cost Trees},\n booktitle = {Structural Information and Communication Complexity - 21st International\n Colloquium, {SIROCCO} 2014, Takayama, Japan, July 23-25, 2014. Proceedings},\n series = {Lecture Notes in Computer Science},\n volume = {8576},\n pages = {121--136},\n publisher = {Springer},\n year = {2014},\n url = {https://doi.org/10.1007/978-3-319-09620-9\\_11},\n doi = {10.1007/978-3-319-09620-9\\_11},\n timestamp = {Tue, 14 May 2019 10:00:55 +0200},\n biburl = {https://dblp.org/rec/conf/sirocco/HochuliHW14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Hochuli, A.","Holzer, S.","Wattenhofer, R."],"editor_short":["Halldórsson, M. M."],"key":"DBLP:conf/sirocco/HochuliHW14","id":"DBLP:conf/sirocco/HochuliHW14","bibbaseid":"hochuli-holzer-wattenhofer-distributedapproximationofminimumroutingcosttrees-2014","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-319-09620-9_11"},"downloads":0},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/w/RogerWattenhofer.bib","creationDate":"2020-09-29T17:54:13.191Z","downloads":0,"keywords":[],"search_terms":["distributed","approximation","minimum","routing","cost","trees","hochuli","holzer","wattenhofer"],"title":"Distributed Approximation of Minimum Routing Cost Trees","year":2014,"dataSources":["sBqdbkxTbPrBCJtZ9"]}