32 search results - page 1 / 7 » Approximating Minimum-Power Degree and Connectivity Problems |
ALGORITHMICA
2011
12 years 8 months ago
2011
ESA
2007
Springer
13 years 10 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
13 years 8 months ago
2006
Springer
ADHOCNOW
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
JCO
2006
13 years 4 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 ...