63 search results - page 4 / 13 » Approximating Steiner Networks with Node-Weights |
INFOCOM
2010
IEEE
13 years 4 months ago
2010
IEEE
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...
ADHOCNOW
2005
Springer
13 years 12 months ago
2005
Springer
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...
FOCS
1998
IEEE
13 years 10 months ago
1998
IEEE
CATS
2007
13 years 7 months ago
2007
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...
ISAAC
2004
Springer
13 years 11 months ago
2004
Springer
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...