We study the approximability of the weighted edge-dominating set problem. Although even the unweighted case is NP-Complete, in this case a solution of size at most twice the minimum can be efficiently computed due to its close relationship with minimum maximal matching; however, in the weighted case such a nice relationship is not known to exist. In this paper, after showing that weighted edge domination is as hard to approximate as the well studied weighted vertex cover problem, we consider a natural strategy, reducingedge-dominating set to edge cover.

Скачать книгу бесплатно (pdf, 85 Kb)

---

Читать «A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem»