Sciweavers

Share
33 search results - page 1 / 7
» Approximating Minimum-Power Degree and Connectivity Problems
Sort
View
ALGORITHMICA
2011
7 years 11 months ago
Approximating Minimum-Power Degree and Connectivity Problems
Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena...
ESA
2007
Springer
140views Algorithms» more  ESA 2007»
9 years 1 months ago
On Minimum Power Connectivity Problems
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...
Yuval Lando, Zeev Nutov
ADHOCNOW
2008
Springer
9 years 1 months ago
Approximating Minimum-Power k-Connectivity
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...
Zeev Nutov
JCO
2006
126views more  JCO 2006»
8 years 7 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
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 ...
Yu Wang 0003, Xiang-Yang Li
books