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.
Distributed Approximation of Minimum Routing Cost Trees [link]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