Mean analysis of an online algorithm for the vertex cover problem

  • Authors:

  • Etienne Birmelé;François Delbot;Christian Laforest

  • Affiliations:

  • Laboratoire Statistique and Génome, UMR CNRS 8071, INRA 1152, Université d'Evry, Tour Evry 2, 523 place des terrasses, 91000 Evry, France;Laboratoire IBISC, FRE CNRS 3190, Université d'Evry, Tour Evry 2, 523 place des terrasses, 91000 Evry, France;LIMOS, UMR 6158 CNRS, Université B. Pascal, Campus scientifique des Cézeaux, 63173 Aubiere cedex, France

  • Venue:
  • Information Processing Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.89

Visualization

Abstract

In 2005, Demange and Paschos proposed in [M. Demange, V.Th. Paschos, On-line vertex-covering, Theoret. Comput. Sci. 332 (2005) 83-108] an online algorithm (noted LR here) for the classical vertex cover problem. They shown that, for any graph of maximum degree @D, LR constructs a vertex cover whose size is at most @D times the optimal one (this bound is tight in the worst case). Very recently, two of the present authors have shown in [F. Delbot, C. Laforest, A better list heuristic for vertex cover, Inform. Process. Lett. 107 (2008) 125-127] that LR has interesting properties (it is a good ''list algorithm'' and it can easily be distributed). In addition, LR has good experimental behavior in spite of its @D approximation (or competitive) ratio and the fact that it can be executed without the knowledge of the full instance at the beginning. In this paper we analyze it deeper and we show that LR has good ''average'' performances: we prove that its mean approximation ratio is strictly less than 2 for any graph and is equal to 1+e^-^2~1.13 in paths. LR is then a very interesting algorithm for constructing small vertex covers, despite its bad worst case behavior.