217 search results - page 11 / 44 » Approximating Minimum Manhattan Networks |
COCOON
2004
Springer
14 years 3 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
JCO
2006
13 years 9 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
INFOCOM
2011
IEEE
13 years 1 months ago
2011
IEEE
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
MOBIQUITOUS
2007
IEEE
14 years 4 months ago
2007
IEEE
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...