Approximation algorithms for the test cover problem

Mathematical Programming

Volumn 98, Issue 1-3, 2003, Pages 477-491

  De Bontridder, K M J ^a   Halldorsson B V ^b   Halldorsson M M ^c,d   Hurkens, C A J ^e   Lenstra, J K ^e,f   Ravi, R ^g   Stougie, L ^e  

^a Siemens VDO Automotive   (Netherlands)

^b CELERA GENOMICS   (United States)

^c UNIVERSITY OF ICELAND   (Iceland)

^d Iceland Genomics Corporation   (Iceland)

^e EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^f Georgia Institute of Technology   (United States)

^g CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Computational complexity; Greedy algorithm; Local search; Path packing; Performance guarantee; Set covering; Test cover

Indexed keywords

GREEDY ALGORITHMS; LOCAL SEARCH; PATH PACKINGS; PERFORMANCE GUARANTEES; SET COVERINGS; TEST COVER;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY;

TESTING;

EID: 21044443561     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-003-0414-6     Document Type: Conference Paper

References (17)

1. De Bontridder, K.M.J., Halldórsson, B.V., Halldórsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Local improvement algorithms for a path packing problem: a performance analysis based on linear programming. In preparation, 2003
2. De Bontridder, K.M.J., Lageweg, B.J., Lenstra, J.K., Orlin, J.B., Stougie, L.: Branch-and-bound algorithms for the test cover problem. R.H. Möhring, R. Raman (eds.). Algorithms-ESA 2002, LNCS, Springer, Berlin, 2002, pp. 223-233
3. Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45, 634-652 (1998)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979
5. Halldórsson, B.V., Halldórsson, M.M., Ravi, R.: On the approximability of the minimum test collection problem. F. Meyer auf der Heide (ed.). Algorithms-ESA 2001, LNCS 2161, Springer, Berlin, 2001, pp. 158-169
6. Halldórsson, B.V., Minden, J.S., Ravi, R.: PIER: Protein identification by epitope recognition. N. El-Mabrouk, T. Lengauer, D. Sankoff (eds.). Currents in Computational Molecular Biology 2001, pp. 109-110
7. Hurkens, C.A.J., Schrijver, A.: 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 Discr. Math. 2, 68-72 (1989)
8. Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9, 256-278 (1972)
9. Johnson, D.S.: The NP-completeness column: an ongoing guide. J Algo. 4, 393-405 (1981)
10. Kann, V.: On the approximability of NP-complete optimization problems, PhD thesis, Royal Institute of Technology, Stockholm, Sweden, 1992
11. Kirkpatrick, D.G., Hell, P.: On the complexity of a generalized matching problem. Proceedings of the Tenth Annual ACM Symposium on Theory of Computing. 1978, pp. 240-245
12. Kolen, A.W.J., Lenstra, J.K.: Combinatorics in operations research. R. Graham, M. Grötschel, L. Lovász (eds.). Handbook of Combinatorics, Elsevier Science, Amsterdam, 1995, pp. 1875-1910
13. Lageweg, B.J., Lenstra, J.K., Rinnooy Kan, A.H.G.: Uit de practijk van de besliskunde. A.K. Len-stra, H.W. Lenstra, J.K. Lenstra (eds.), Tamelijk briljant; Opstellen aangeboden aan Dr. T.J. Wansbeek, Amsterdam. 1980
14. Lovász, L.: On the ratio of optimal integral and fractional covers. Discr. Math. 13, 383-390 (1975)
15. Moret, B.M.E., Shapiro, H.D.: On minimizing a set of tests. SIAM J Scien. Statis. Comp. 6, 983-1003 (1985)
16. Petrank, E.:Thehardness of approximations: gap location. ComputationalComplexity 4, 133-157 (1994)
17. Raz, R., Safra, S.:.A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing 475-484 (1997)