107 search results - page 6 / 22 » Prize-Collecting Steiner Network Problems |
NETWORKS
2006
13 years 7 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
JNCA
2011
12 years 10 months ago
2011
Recently, several studies have been conducted to design mobility‐based multicast routing protocols for wireless mobile ad hoc networks (MANET). These ...
GECCO
2004
Springer
14 years 28 days ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
ISAAC
2004
Springer
14 years 27 days 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...
INFOCOM
2010
IEEE
13 years 5 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...