✦ LIBER ✦

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

✍ Scribed by Decheng Dai; Changyuan Yu

Book ID: 108281503
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 919 KB
Volume: 410
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.11.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On approximation algorithms of -connecte

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

✍ My T. Thai; Ning Zhang; Ravi Tiwari; Xiaochun Xu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 590 KB

Tighter Approximation Bounds for Minimum

Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs

✍ Minming Li; Peng-Jun Wan; Frances Yao 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 740 KB

Approximations for node-weighted Steiner

Approximations for node-weighted Steiner tree in unit disk graphs

✍ X. Xu; Y. Wang; H. Du; P.-J. Wan; F. Zou; X. Li; W. Wu 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 220 KB

A({{10}})-Approximation Algorithm for a

A({{10}})-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem

✍ Robert Carr; Toshihiro Fujito; Goran Konjevod; Ojas Parekh 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 85 KB

Hardness results and approximation algor

Hardness results and approximation algorithms for (weighted) paired-domination in graphs

✍ Lei Chen; Changhong Lu; Zhenbing Zeng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 532 KB