Abstract

TORRICO, Lucio.   Approximation algorithm for unicost cover problem. Rev Inv Tec [online]. 2013, n.2, pp. 11-18. ISSN 2306-0522.

ABSTRACT Exact solutions for unicost set cover problem generally are obtained through intractable algorithms, since the problem is NP. There are different approximation algorithms of polynomial type. By example the Johnson's standard algorithm that uses Greedy technique. Here we present an approximation algorithm that implements redundancy reduction, using disjunctions and a metric, for deselect subsets, based on their demerits. This algorithm seems to perform well in the experiments we perform. compared to the standard algorithm and even other approximate algorithms.

Keywords : approximation algorithm; set cover; unicost set cover.