710 search results - page 15 / 142 » On Minimum Power Connectivity Problems |
127
Voted
INFOCOM
2008
IEEE
15 years 10 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...
144
Voted
APPROX
2009
Springer
15 years 10 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...
182
Voted
APPROX
2000
Springer
15 years 8 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
117
Voted
CNSR
2005
IEEE
15 years 9 months ago
2005
IEEE
Connectivity in mobile wireless ad-hoc networks is maintained by setting the transmission range so that a node can establish a link to any other node in the network either directl...
219
Voted
CVPR
2010
IEEE
15 years 11 days ago
2010
IEEE
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...