A tighter analysis of set cover greedy algorithm for test set

Authors:
Peng Cui
Affiliations:
Renmin University of China, Beijing, China
Venue:
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Year:
2007

Citing 4
Cited 1

A tight analysis of the greedy algorithm for set cover

Journal of Algorithms
Randomized rounding without solving the linear program

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Tight approximability results for test set problems in bioinformatics

Journal of Computer and System Sciences
Highly scalable algorithms for robust string barcoding

International Journal of Bioinformatics Research and Applications

Detecting multiple facets of an event using graph-based unsupervised methods

COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Set cover greedy algorithm is a natural approximation algorithm for test set problem. This paper gives a precise and tighter analysis of approximation ratio of this algorithm. The author improves the approximation ratio 2 ln n directly derived from set cover to 1.14 ln n by applying potential function technique of derandomization method. In addition, the author gives a nontrivial lower bound (1+α) ln n of approximation ratio, where a is α positive constant. This lower bound, together with the matching bound of information content heuristic, confirms the fact information content heuristic is slightly better than set cover greedy algorithm in worst case.