833 search results - page 40 / 167 » Simpler and better approximation algorithms for network desi... |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In this work we consider energy-efficient resource management in an environment monitoring and hazard detection sensor network. Our goal is to allocate different detection methods...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In many networks, vertices have hidden attributes that are correlated with the network's topology. For instance, in social networks, people are more likely to be friends if t...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
MP
1998
13 years 7 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—Radio channel quality of real-world wireless networks tends to exhibit both short-term and long-term temporal variations that are in general difficult to model. To maxi...