Re: [igraph] edge domination in igraph?

[Tamas Nepusz]

Hi,

> I know that finding a minimum edge dominating set is an NP-hard
> problem. However, I was wondering whether there is an approximation
> algorithm which is implemented in igraph.
A pretty easy approximation algorithm with a multiplicative factor of 2 is
as follows: find _any_ maximal matching. That's pretty easy; take an
unmatched vertex, check whether it has an unmatched neighbor, and if so,
assign them to each other. Repeat until finished. Otherwise I am not aware
of any algorithm in igraph that can be used for approximating a minimum edge
dominating set.

Best,
Tamas