Exact algorithms for finding minimum transversals in rank-3 hypergraphs

Journal of Algorithms

Volumn 51, Issue 2, 2004, Pages 107-121

  Wahlström, Magnus ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

3 Hitting Set; Exact algorithm; Hypergraph; Minimum transversal

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

3-HITTING SET; EXACT ALGORITHMS; HYPERGRAPH; MINIMUM TRAVERSAL;

GRAPH THEORY;

EID: 2442457813     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.01.001     Document Type: Article

References (14)

1. C. Berge, Hypergraphs, North-Holland, 1989.
2. D. de Caen, Extensions of a theorem of Moon and Moser on complete subgraphs, Ars Combinatoria 16 (1983) 5-10.
3. R.G. Downey, M.R. Fellows, U. Stege, Parameterized complexity: A framework for systematically confronting computational intractability, in: Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, in: AMS-DIMACS, vol. 49, Amer. Math. Soc. Press, 1999, pp. 49-99.
4. T. Eiter, G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, SIAM J. Comput. 24 (6) (1995) 1278-1304.
5. M.L. Fredman, L. Khachiyan, On the complexity of monotone disjunctive normal forms, J. Algorithms 21 (3) (1996) 618-628.
6. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Fransisco, 1979.
7. R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, 2nd ed., Addison-Wesley, 1994.
8. D. Gunopulos, H. Mannila, R. Khardon, H. Toivonen, Data mining, hypergraph transversals, and machine learning, in: Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 1997), ACM Press, 1997, pp. 209-216.
9. D.J. Kavvadias, E.C. Stavropoulos, Evaluation of an algorithm for the transversal hypergraph problem, in: Proceedings of the 3rd International Workshop on Algorithm Engineering (WAE 1999), in: Lecture Notes in Comput. Sci., vol. 1668, Springer-Verlag, 1999, pp. 72-84.
10. M. Krivelevich, R. Nathaniel, B. Sudakov, Approximating coloring and maximum independent sets in 3-uniform hypergraphs, J. Algorithms 41 (2001) 99-113.
11. O. Kullmann, New methods for 3-SAT decision and worst-case analysis, Theoret. Comput. Sci. 223 (1998) 1-72.
12. N. Mishra, L. Pitt, Generating all maximal independent sets of bounded-degree hypergraphs, in: Proceedings of the Tenth Annual Conference on Computational Learning Theory (COLT 1997), ACM Press, 1997, pp. 211-217.
13. R. Niedermeier, P. Rossmanith, An efficient fixed parameter algorithm for 3-hitting set, J. Discrete Algorithms 1 (2003) 89-102.
14. J.M. Robson, Algorithms for maximum independent sets, J. Algorithms 7 (1986) 425-440.