𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constant-time distributed dominating set approximation

✍ Scribed by Fabian Kuhn; Roger Wattenhofer

Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
193 KB
Volume
17
Category
Article
ISSN
0178-2770

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

Approximation hardness of edge dominatin
Approximation hardness of edge dominating set problems
✍ Miroslav ChlebΓ­k; Janka ChlebΓ­kovΓ‘ πŸ“‚ Article πŸ“… 2006 πŸ› Springer US 🌐 English βš– 324 KB

We provide the first interesting explicit lower bounds on efficient approximability for two closely related optimization problems in graphs, MINIMUM EDGE DOMINATING SET and MINIMUM MAXIMAL MATCHING. We show that it is NP-hard to approximate the solution of both problems to within any constant factor