Comment:
Also known as Minimum Fill-in.
Approximable within
[363], where
denotes the
minimum number of fill edges needed.
Approximable within
for graphs with bounded
degree
[305], and within
[363].
See results on related problems under MINIMUM TREE WIDTH.