P228: Enumeration of $z$ smallest weighted edge dominating sets in a graph

P228: Enumeration of $z$ smallest weighted edge dominating sets in a graph

Input:

An weighted graph $G = (V, E)$, and positive integers $k$ and $z$. Each edge of $G$ has a positive weight.

Output:

$z$ smallest weighted edge dominating sets in $G$.

Complexity:

$O(5.6^{2k}k^4z^2 +4^{2k}k^3z|V|)$ total time.

Comment:

Reference:

[Wang2009] (Bibtex)