✦ LIBER ✦

Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs

✍ Scribed by Minming Li; Peng-Jun Wan; Frances Yao

Publisher: Springer
Year: 2011
Tongue: English
Weight: 740 KB
Volume: 61
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-011-9512-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Weakly Robust PTAS for Minimum Clique

A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs

✍ Imran A. Pirwani; Mohammad R. Salavatipour 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 763 KB

PTAS for minimum weighted connected vert

PTAS for minimum weighted connected vertex cover problem withc-local condition in unit disk graphs

✍ Lidan Fan; Zhao Zhang; Wei Wang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 416 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