Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...