667 search results - page 23 / 134 » Approximation algorithms for connected facility location pro... |
138
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
151
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
118
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
147
Voted
SECON
2010
IEEE
15 years 15 days ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
110
click to vote
COR
2007
15 years 2 months ago
2007
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...