1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
Alexandra Hochuli, Stephan Holzer, Roger Wattenhofer
We study the NP-hard problem of approximating a Minimum Routing Cost Spanning Tree in the message passing model with limited bandwidth (CONGEST model). In this problem one tries to…