Combining Two Worlds: Parameterised Approximation for Vertex Cover

@inproceedings{Brankovic2010CombiningTW,
  title={Combining Two Worlds: Parameterised Approximation for Vertex Cover},
  author={Ljiljana Brankovic and Henning Fernau},
  booktitle={ISAAC},
  year={2010}
}
We explore opportunities for parameterising constant factor approximation algorithms for vertex cover. We provide a simple algorithm that works on any approximation ratio of the form \(\frac {2l+1}{l+1}\) and has complexity that outperforms an algorithm by Bourgeois et al. derived from a sophisticated exact parameterised algorithm. In particular, for l = 1 (factor 1.5 approximation) our algorithm runs in time \(\mathcal{O}^{*}(1.09^{k})\). Additionally, we present an improved polynomial-time… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

Vertex Cover: Further Observations and Further Improvements

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Efficient bounds for the stable set, vertex cover and set packing problems

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

A note on vertex cover in graphs with maximum degree 3

  • M. Xiao
  • Thai, T. (ed.) COCOON 2010. LNCS, vol. 6196, pp. 150–159. Springer, Heidelberg
  • 2010

Parameterized Complexity and Approximation Algorithms

VIEW 2 EXCERPTS

On Parameterized Approximability

VIEW 1 EXCERPT

Refined memorization for vertex cover