Distributed Approximation of Minimum Routing Cost Trees

DOI10.1007/978-3-319-09620-9_11zbMath1416.68135arXiv1406.1244OpenAlexW1815118760MaRDI QIDQ5496154

Alexandra Hochuli, Roger Wattenhofer, Stephan Holzer

Publication date: 7 August 2014

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.1244

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Approximation algorithms (68W25) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (1)

On the minimum routing cost clustered tree problem

This page was built for publication: Distributed Approximation of Minimum Routing Cost Trees