Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs

@inproceedings{Feldmann2020FastHN,
  title={Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs},
  author={Michel Feldmann and Kristian Hinnenthal and C. Scheideler},
  booktitle={OPODIS},
  year={2020}
}
We consider the problem of computing shortest paths in hybrid networks, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a local and… Expand
3 Citations

Figures from this paper

References

SHOWING 1-10 OF 62 REFERENCES
Distributed Computation in Node-Capacitated Networks
  • 9
Faster Construction of Overlay Networks
  • 4
Distributed approximation algorithms for weighted shortest paths
  • 156
  • PDF
Distributed Algorithms for Network Diameter and Girth
  • 75
...
1
2
3
4
5
...