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 2ln n directly derived from set cover to 1.14ln 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 α is a 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Moret, B.M.E., Shipiro, H.D.: On minimizing a set of tests. SIAM Journal on Scientific and Statistical Computing 6, 983–1003 (1985)
De Bontridder, K.M.J., Halldórsson, B.V., Halldórsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithm for the test cover problems. Mathematical Programming-B 98, 477–491 (2003)
Berman, P., DasGupta, B., Kao, M.: Tight approximability results for test set problems in bioinformatics. Journal of Computer and System Sciences 71, 145–162 (2005)
DasGupta, B., Konwar, K., Mandoiu, I., Shvartsman, A.: Highly scalable algorithms for robust string barcoding. International Journal of Bioinformatics Research and Applications 1, 145–161 (2005)
Young, N.E.: Randomized rounding without solving the linear program. In: SODA 1995. Sixth ACM-SIAM Symposium on Discrete Algorithms, pp. 170–178. ACM Press, New York (1995)
Slavík, P.: A tight analysis of the greedy algorithm for set cover. Journal of Algorithms 25, 237–254 (1997)
Cui, P., Liu, H.: Deep Approximation of Set Cover Greedy Algorithm for Test Set (in Chinese). Journal of Software 17, 1494–1500 (2006)
Borneman, J., Chrobak, M., Vedova, G.D., Figueora, A., Jiang, T.: Probe selection algorithms with applications in the analysis of microbial communities. Bioinformatics 17(Suppl. 1), S39–S48 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cui, P. (2007). A Tighter Analysis of Set Cover Greedy Algorithm for Test Set. In: Chen, B., Paterson, M., Zhang, G. (eds) Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. ESCAPE 2007. Lecture Notes in Computer Science, vol 4614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74450-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-74450-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74449-8
Online ISBN: 978-3-540-74450-4
eBook Packages: Computer ScienceComputer Science (R0)