✦ LIBER ✦

Improved approximation bounds for edge dominating set in dense graphs

✍ Scribed by Jean Cardinal; Stefan Langerman; Eythan Levy

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating edge dominating set in den

Approximating edge dominating set in dense graphs

✍ Richard Schmied; Claus Viehmann 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Approximation hardness of dominating set

Approximation hardness of dominating set problems in bounded degree graphs

✍ M. Chlebík; J. Chlebíková 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 235 KB

PTAS for the minimum weighted dominating

PTAS for the minimum weighted dominating set in growth bounded graphs

✍ Zhong Wang, Wei Wang, Joon-Mo Kim, Bhavani Thuraisingham, Weili Wu 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 138 KB

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 PTAS for minimumd-hop connected domina

A PTAS for minimumd-hop connected dominating set in growth-bounded graphs

✍ Xiaofeng Gao; Wei Wang; Zhao Zhang; Shiwei Zhu; Weili Wu 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 264 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