A 2-approximation algorithm for the minimum weight edge dominating set problem

Citations of this article
Mendeley users who have this article in their library.


We present a polynomial-time algorithm approximating the minimum weight edge dominating set problem within a factor of 2. It has been known that the problem is NP-hard but, when edge weights are uniform (so that the smaller the better), it can be efficiently approximated within a factor of 2. When general weights were allowed, however, very little had been known about its approximability, and only very recently was it shown to be approximable within a factor of 2 1/10 by reducing to the edge cover problem via LP relaxation. In this paper we extend the approach given therein, by studying more carefully polyhedral structures of the problem, and obtain an improved approximation bound as a result. While the problem considered is as hard to approximate as the weighted vertex cover problem is, the best approximation (constant) factor known for vertex cover is 2 even for the unweighted case, and has not been improved in a long time, indicating that improving our result would be quite difficult. © 2002 Elsevier Science B.V.




Fujito, T., & Nagamochi, H. (2002). A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Applied Mathematics, 118(3), 199–207. https://doi.org/10.1016/S0166-218X(00)00383-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free