Choose Outsiders First: a mean 2-approximation random algorithm for covering problems
Data Structures and Algorithms
2013-05-14 v2 Computational Complexity
Abstract
A high number of discrete optimization problems, including Vertex Cover, Set Cover or Feedback Vertex Set, can be unified into the class of covering problems. Several of them were shown to be inapproximable by deterministic algorithms. This article proposes a new random approach, called Choose Outsiders First, which consists in selecting randomly ele- ments which are excluded from the cover. We show that this approach leads to random outputs which mean size is at most twice the optimal solution.
Cite
@article{arxiv.1208.5907,
title = {Choose Outsiders First: a mean 2-approximation random algorithm for covering problems},
author = {Etienne Birmelé},
journal= {arXiv preprint arXiv:1208.5907},
year = {2013}
}
Comments
8 pages The paper has been withdrawn due to an error in the proof