On the approximability of the minimum test collection problem (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2161, Issue , 2001, Pages 158-169

  Halldórsson, Bjarni V ^a   Halldórsson, Magnús M ^b,c   Ravi, R ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF ICELAND   (Iceland)

^c Iceland Genomics Corporation   (Iceland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APPROXIMABILITY; APX-HARDNESS; CARDINALITIES; EXTENDED ABSTRACTS; GREEDY ALGORITHMS; PERFORMANCE GUARANTEES; TEST COLLECTION; TEST SIZE;

APPROXIMATION ALGORITHMS;

EID: 84943272707     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_13     Document Type: Conference Paper

References (17)

1. M. Abbink. The test cover problem. Master's thesis, University of Amsterdam, 1995.
2. S. Arora and M. Sudan. Improved low degree testing and its applications. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages, 485-495, El Paso, Texas, 4-6 May 1997.
3. K.M.J. De Bontridder. Methods for solving the test cover problem. Master's thesis, Eindhoven University of Technology, 1997.
4. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45:634-652, 1998.
5. U. Feige and J. Killian. Zero knowledge and the chromatic number. J. Comput. System Sci., 57:187-199, 1998.
6. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, 1979.
7. B.V. Halldórsson, J.S. Minden, and R. Ravi. PIER: Protein identification by epi-tope recognition. In N. El-Mabrouk, T. Lengauer, and D. Sankoff, editors, Currents in Computational Molecular Biology 2001, pages, 109-110, 2001.
8. M.M. Halldórsson. A still better performance guarentee for approximate graph coloring. Information Processing Letters, 45:19-23, 1993.
9. D. S. Hochbaum Approximation Algorithms for NP-hard problems. PWS, 1997.
10. C.A.J. Hurkens and A. Schrijver. On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Discrete Mathematics, 2:68-72, 1989.
11. D.S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. System Sci, 9:256-278, 1972.
12. V. Kann Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters, 37:27-35, 1991.
13. R. Loulou. Minimal cut cover of a graph with an application to the testing of electronic boards. Operations Research Letters, 12:301-305, 1992.
14. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383-390, 1975.
15. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM, 41(5):960-981, 1994.
16. B.M.E. Moret and H.D. Shapiro. On minimizing a set of tests. SIAM Journal on Scientific and Statistical Computing, 6:983-1003, 1985.
17. R. Motwani and J. Naor. On exact and approximate cut covers of graphs. Technical report, Stanford University, 1994.