570 search results - page 37 / 114 » Approximating Some Network Design Problems with Node Costs |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
: Collaborative beamforming (CB) and cooperative transmission (CT) have recently emerged as communication techniques that can make effective use of collaborative/cooperative nodes ...
TON
2010
13 years 3 months ago
2010
A large number of network applications today allow several users to interact together using the many-to-many service mode. In many-to-many communication, also referred to as group ...
COMCOM
2010
13 years 9 months ago
2010
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
COR
2008
13 years 8 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...