✦ LIBER ✦

On approximation algorithms of -connected -dominating sets in disk graphs

✍ Scribed by My T. Thai; Ning Zhang; Ravi Tiwari; Xiaochun Xu

Book ID: 108281334
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 590 KB
Volume: 385
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.05.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A -approximation algorithm for minimum w

A -approximation algorithm for minimum weighted dominating set in unit disk graph

✍ Decheng Dai; Changyuan Yu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 919 KB

A better constant-factor approximation f

A better constant-factor approximation for weighted dominating set in unit disk graph

✍ Yaochun Huang; Xiaofeng Gao; Zhao Zhang; Weili Wu 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 417 KB

This paper presents a (10 + ε)-approximation algorithm to compute minimum-weight connected dominating set (MWCDS) in unit disk graph. MWCDS is to select a vertex subset with minimum weight for a given unit disk graph, such that each vertex of the graph is contained in this subset or has a neigh

A new distributed approximation algorith

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

✍ Bo Gao; Yuhang Yang; Huiye Ma 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 516 KB

Linear Time Algorithms for Finding a Dom

Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs

✍ Noga Alon; Shai Gutner 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 310 KB

An approximation algorithm for finding a

An approximation algorithm for finding ad-regular spanning connected subgraph of maximum weight in a complete graph with random weights of edges

✍ A. E. Baburin; E. Kh. Gimadi 📂 Article 📅 2008 🏛 Pleiades Publishing 🌐 English ⚖ 713 KB