On approximability of the independent/connected edge dominating set problems
We investigate polynomial-time approximability of the problems related to edge dominating sets of graphs. When edges are unit-weighted, the edge dominating set problem is polynomially equivalent to the minimum maximal matching problem, in either exact or approximate computation, and the former problem was recently found to be approximable within a factor of 2 even with arbitrary weights. It will be shown, in contrast with this, that the minimum weight maximal matching problem cannot be approximated within any polynomially computable factor unless P = NP. The connected edge dominating set problem and the connected vertex cover problem also have the same approximability when edges/vertices are unit-weighted. The former problem is already known to be approximable, even with general edge weights, within a factor of 3.55. We will show that, when general weights are allowed, (1) the connected edge dominating set problem can be approximated within a factor of 3 + epsilon, and (2) the connected vertex cover problem is approximable within a factor of lnn + 3 but cannot be within (1 - epsilon) lnn for any epsilon > 0 unless NP subset of DTIME(n(O(loglogn))). (C) 2001 Elsevier Science B.V. All rights reserved.
edge dominating set combinatorial optimization problems approximation algorithms