Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ADHOCNOW

2008

Springer

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 (sub)network is k-connected and the total power is minimum. We give a new very simple approximation algorithm for this problem that signiﬁcantly improves the previously best known approximation ratios. Speciﬁcally, the approximation ratios of our algorithm are: - 3 (improving (3 + 2/3)) for k = 2; - 4 (improving (5 + 2/3)) for k = 3; - k+3 for k ∈ {4, 5} and k+5 for k ∈ {6, 7} (improving k+2 (k+1)/2 ); - 3(k − 1) (improving 3k) for any constant k. Our results are based on a (k + 1)-approximation algorithm (improving the ratio k + 4) for the problem of ﬁnding a Min-Power k-Inconnected Subgraph, which is of independent interest.

Related Content

Added |
01 Jun 2010 |

Updated |
01 Jun 2010 |

Type |
Conference |

Year |
2008 |

Where |
ADHOCNOW |

Authors |
Zeev Nutov |

Comments (0)