710 search results - page 3 / 142 » On Minimum Power Connectivity Problems |
JCO
2008
13 years 5 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
FOCS
2009
IEEE
13 years 12 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
WCNC
2008
IEEE
13 years 11 months ago
2008
IEEE
— In this paper, we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is...
ICMCS
2007
IEEE
13 years 9 months ago
2007
IEEE
In this work, we investigate the routing problems ofminimizing the number ofdistinct transmission mediums or carrier domains for multimedia communications. We consider the problem...
ICDCSW
2003
IEEE
13 years 10 months ago
2003
IEEE
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...