A Tighter Analysis of Setcover Greedy Algorithm for Test Set - Computer Science > Data Structures and AlgorithmsReportar como inadecuado




A Tighter Analysis of Setcover Greedy Algorithm for Test Set - Computer Science > Data Structures and Algorithms - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Setcover greedy algorithm is a natural approximation algorithm for test setproblem. This paper gives a precise and tighter analysis of performanceguarantee of this algorithm. The author improves the performance guarantee$2\ln n$ which derives from set cover problem to $1.1354\ln n$ by applying thepotential function technique. In addition, the author gives a nontrivial lowerbound $1.0004609\ln n$ of performance guarantee of this algorithm. This lowerbound, together with the matching bound of information content heuristic,confirms the fact information content heuristic is slightly better thansetcover greedy algorithm in worst case.



Autor: Peng Cui

Fuente: https://arxiv.org/







Documentos relacionados