Searching for "On Minimum Power Connectivity Problems." – sorted by Relevance.
-
Approximating minimum-power degree and connectivity problems
- Approximating Minimum-Power Degree and Connectivity Problems Guy Kortsarz* Vahab S. Mirrokni
- Cited by 2 (1 self) – Add To MetaCart
-
Approximating Minimum-Power Edge-Covers and 2, 3-Connectivity
- -CS) problem. Minimum-Power k-Connected Subgraph (MPk-CS): Instance: A graph G = (V, E) with edge costs {c
- Add To MetaCart
-
unknown title
- Problems 3 previously known approximation ratio for the minimum power k-connected was 2k = O(k) [5, 11, 19
- Add To MetaCart
-
Power optimization for connectivity problems
- is the maximum cost of an edge outgoing from v. We give some evidence that minimum-power connectivity problems
- Cited by 10 (7 self) – Add To MetaCart

