Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks
Michał Szyfelbein, Camille Richer
We study problems related to connecting multi-interface networks of wireless devices. These problems can be modeled using graphs, where vertices represent the devices and edges rep…
cs.DS2026
Parameterized Algorithms for Computing MAD Trees
Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann +2
We consider the well-studied problem of finding a spanning tree with minimum average distance between vertex pairs (called a MAD tree). This is a classic network design problem whi…