710 search results - page 1 / 142 » On Minimum Power Connectivity Problems |
MWCN
2004
Springer
14 years 4 months ago
2004
Springer
We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes of the network are connected by bidirectional links and...
ESA
2007
Springer
14 years 5 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
APPROX
2006
Springer
14 years 2 months ago
2006
Springer
ALGORITHMICA
2011
13 years 2 months ago
2011
EVOW
2009
Springer
14 years 6 months ago
2009
Springer
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...