Peng Cui. A Tighter Analysis of Set Cover Greedy Algorithm for Test Set. In Bo Chen, Mike Paterson, Guochuan Zhang, editors, Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers. Volume 4614 of Lecture Notes in Computer Science, pages 24-35, Springer, 2007. [doi]
@inproceedings{Cui07,
title = {A Tighter Analysis of Set Cover Greedy Algorithm for Test Set},
author = {Peng Cui},
year = {2007},
doi = {10.1007/978-3-540-74450-4_3},
url = {http://dx.doi.org/10.1007/978-3-540-74450-4_3},
tags = {testing, analysis},
researchr = {https://researchr.org/publication/Cui07},
cites = {0},
citedby = {0},
pages = {24-35},
booktitle = {Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers},
editor = {Bo Chen and Mike Paterson and Guochuan Zhang},
volume = {4614},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-74449-8},
}