Join Our Newsletter

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

OL

2011

2011

Given a simple undirected graph, the minimum connected dominating set problem is to ﬁnd a minimum cardinality subset of vertices D inducing a connected subgraph such that each vertex outside D has at least one neighbor in D. Approximations of minimum connected dominating sets are often used to represent a virtual routing backbone in wireless networks. This paper ﬁrst proposes a constant-ratio approximation algorithm for the minimum connected dominating set problem in unit ball graphs and then introduces and studies the edge-weighted bottleneck connected dominating set problem, which seeks a minimum edge weight in the graph such that the corresponding bottleneck subgraph has a connected dominating set of size k. In wireless network applications this problem can be used to determine an optimal transmission range for a network with a predeﬁned size of the virtual backbone. We show that the problem is hard to approximate within a factor better than 2 in graphs whose edge weights sati...

Related Content

Added |
14 May 2011 |

Updated |
14 May 2011 |

Type |
Journal |

Year |
2011 |

Where |
OL |

Authors |
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii Ursulenko |

Comments (0)