570 search results - page 25 / 114 » Approximating Some Network Design Problems with Node Costs |
110
click to vote
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
113
click to vote
CDC
2009
IEEE
14 years 11 months ago
2009
IEEE
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
117
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
113
click to vote
WICON
2008
15 years 2 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
132
click to vote
INFOCOM
2010
IEEE
14 years 11 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...