<p>I think you can make the classical local ratio algorithm by Bafna et al. give a $2-o(1)$ approximation on the following family of graphs:</p>

<p>Take $G_n$ to be a $K_{n,n}$ (the complete bipertite graph with $n$ vertices on each side), and then delete a single edge. 
The following shows that the algorithm might output all of the "blue" vertices ($2n-4$ in number) as the FVS approximation, while there's a much smaller FVS for $G_n$.</p>

<p><img src="https://i.sstatic.net/yEQih.jpg" alt="enter image description here"></p>

<p>(notice there's no edge between the teal vertices).</p>

<p>The optimal FVS is contains $n-1$ vertices (take all of the vertices on the right, except the top one).</p>

<p>Now there are no semi-disjoint cycles, and the vertices degrees are as follows:</p>

<ol>
<li>Blue / Purple vertices - degree $n$.</li>
<li>Teal vertices - degree $n-1$.</li>
</ol>

<p>This means that the all of the blue/purple vertices will be inserted first into the stack at arbitrary order (the teal vertices enters the stack at the end and are the first to be deleted from $F$).</p>

<p>Assuming that the purple vertices will pushed after (and popped before) the blue ones, they will be removed from $F$ which will be updated to contain all of the blue vertices.</p>

<p>From this point on, no other vertex can be deleted from $F$ (otherwise there will be a cycle using the teal/purpule vertices), and the resulting $FVS$ has size $2n-4$.</p>

<p>This gives us a $\frac{2n-4}{n-1}=2-o(1)$ approximation ratio, hence showing the analysis is tight even for the unweighted case.</p>

CC BY-SA 3.0
2014-04-06T17:20:45.093Z
Thank you! This is exactly what I want. Just a small comment: if I understand Bafna et al.'s algorithm correctly, the purple vertices will not be inserted into the stack, as after all blue vertices are in, the remaining graph is acyclic (a path on four vertices).
Yixin Cao
CC BY-SA 3.0
2014-04-06T17:24:23.863Z
@YixinCao - while the graph is indeed acyclic after the blue ones have been removed, they still loop over all vertices of residual weight 0, and the blue and purple ones get to 0 on the same iteration. At least that's what it looks like from their paper.
R B
CC BY-SA 3.0
2014-04-06T17:34:14.360Z
They conduct cleanup after each step as follows (copied from the paper):  While $G$ contains a vertex of degree at most $1$, remove it along with any incident edges.
Yixin Cao
CC BY-SA 3.0
2014-04-06T17:37:43.747Z
sorry, you're correct, and I misunderstood something.
Yixin Cao
CC BY-SA 3.0
2014-04-06T10:32:50.840Z
2014-06-01T18:37:48.543Z
2014-06-01T18:37:48.543Z
R B
<p>There are several 2-approximation algorithms for the UNWEIGHTED feedback vertex set problem (FVS), which are summarized in [4]. Note that the reduction from vertex cover to FVS is approximation-preserving. Assuming Unique Game Conjecture, we cannot expect better algorithms. The question is: </p>

<p><strong>Is there an unweighted graph on which some of the algorithm really reaches ratio 2?</strong></p>

<p>[1] contains such a tight instance for weighted FVS.</p>

<ol>
<li>Vineet Bafna and Piotr Berman and Toshihiro Fujito,
<a href="http://doi.org/10.1137/S0895480196305124">http://doi.org/10.1137/S0895480196305124</a>; </li>
<li>Ann Becker and Dan
Geiger, <a href="http://doi.org/10.1016/0004-3702(95)00004-6">http://doi.org/10.1016/0004-3702(95)00004-6</a>; </li>
<li>Toshihiro
Fujito, <a href="http://doi.org/10.1016/0020-0190(96)00094-4">http://doi.org/10.1016/0020-0190(96)00094-4</a>; </li>
<li>Fabián A.
Chudak, Michel X. Goemans, Dorit S. Hochbaum, David P. Williamson,
<a href="http://doi.org/10.1016/S0167-6377(98)00021-2">http://doi.org/10.1016/S0167-6377(98)00021-2</a>.</li>
</ol>

<reference-request><graph-algorithms><approximation-algorithms>
Tight examples for approximating the feedback vertex set problem
Yixin Cao
# Tight examples for approximating the feedback vertex set problem

(Asked by: username_0 on 2014-04-06)

There are several 2-approximation algorithms for the UNWEIGHTED feedback vertex set problem (FVS), which are summarized in [4]. Note that the reduction from vertex cover to FVS is approximation-preserving. Assuming Unique Game Conjecture, we cannot expect better algorithms. The question is:

**Is there an unweighted graph on which some of the algorithm really reaches ratio 2?**

[1] contains such a tight instance for weighted FVS.

1. Vineet Bafna and Piotr Berman and Toshihiro Fujito,
   <http://doi.org/10.1137/S0895480196305124>;
2. Ann Becker and Dan
   Geiger, <http://doi.org/10.1016/0004-3702(95)00004-6>;
3. Toshihiro
   Fujito, <http://doi.org/10.1016/0020-0190(96)00094-4>;
4. Fabián A.
   Chudak, Michel X. Goemans, Dorit S. Hochbaum, David P. Williamson,
   <http://doi.org/10.1016/S0167-6377(98)00021-2>.

**Tags:** reference-request, graph-algorithms, approximation-algorithms


---

## 1 answers

### Answer by username_1 on 2014-04-06. Score: 7 | Accepted answer

I think you can make the classical local ratio algorithm by Bafna et al. give a $2-o(1)$ approximation on the following family of graphs:

Take $G\_n$ to be a $K\_{n,n}$ (the complete bipertite graph with $n$ vertices on each side), and then delete a single edge.
The following shows that the algorithm might output all of the "blue" vertices ($2n-4$ in number) as the FVS approximation, while there's a much smaller FVS for $G\_n$.

![enter image description here](https://i.sstatic.net/yEQih.jpg)

(notice there's no edge between the teal vertices).

The optimal FVS is contains $n-1$ vertices (take all of the vertices on the right, except the top one).

Now there are no semi-disjoint cycles, and the vertices degrees are as follows:

1. Blue / Purple vertices - degree $n$.
2. Teal vertices - degree $n-1$.

This means that the all of the blue/purple vertices will be inserted first into the stack at arbitrary order (the teal vertices enters the stack at the end and are the first to be deleted from $F$).

Assuming that the purple vertices will pushed after (and popped before) the blue ones, they will be removed from $F$ which will be updated to contain all of the blue vertices.

From this point on, no other vertex can be deleted from $F$ (otherwise there will be a cycle using the teal/purpule vertices), and the resulting $FVS$ has size $2n-4$.

This gives us a $\frac{2n-4}{n-1}=2-o(1)$ approximation ratio, hence showing the analysis is tight even for the unweighted case.

> **Comments:**
> **username_0**: Thank you! This is exactly what I want. Just a small comment: if I understand Bafna et al.'s algorithm correctly, the purple vertices will not be inserted into the stack, as after all blue vertices are in, the remaining graph is acyclic (a path on four vertices).  
> **username_1**: @YixinCao - while the graph is indeed acyclic after the blue ones have been removed, they still loop over all vertices of residual weight 0, and the blue and purple ones get to 0 on the same iteration. At least that's what it looks like from their paper.  
> **username_0**: They conduct cleanup after each step as follows (copied from the paper):  While $G$ contains a vertex of degree at most $1$, remove it along with any incident edges.  
> **username_0**: sorry, you're correct, and I misunderstood something.  

---

