298 search results - page 4 / 60 » Multicriteria Steiner Tree Problem for Communication Network |
NETWORKS
1998
13 years 7 months ago
1998
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 ...
ISAAC
2004
Springer
14 years 24 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...
ADHOCNOW
2005
Springer
14 years 1 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...
INFOCOM
1997
IEEE
13 years 11 months ago
1997
IEEE
The paper addresses the issue of minimizing the number of nodes involved in routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a...