An efficient fixed-parameter algorithm for 3-Hitting Set

Journal of Discrete Algorithms

Volumn 1, Issue 1, 2003, Pages 89-102

  Niedermeier, Rolf ^a   Rossmanith, Peter ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

3 Hitting Set; Exact algorithm; Fixed parameter tractability; NP complete problem; Parameterized complexity

Indexed keywords

EID: 77957199315     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1570-8667(03)00009-1     Document Type: Article

References (40)

1. J. Alber, H.L. Bodlaender, H. Fernau, T. Kloks, R. Niedermeier, Fixed parameter algorithms for planar dominating set and related problems on planar graphs, Algorithmica 33 (2002) 461-493.
2. J. Alber, H. Fan, M.R. Fellows, H. Fernau, R. Niedermeier, F. Rosamond, U. Stege, Refined search tree technique for dominating set on planar graphs, in: Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, in: Lecture Notes in Computer Science, Vol. 2136, Springer-Verlag, 2001, pp. 111-122.
3. J. Alber, J. Gramm, R. Niedermeier, Faster exact solutions for hard problems: A parameterized point of view, Discrete Math. 229 (2001) 3-27.
4. S. Arora, C. Lund, Hardness of approximation, in: D. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston, 1997, pp. 399-446.
5. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, Complexity and Approximation - Combinatorial Optimization Problems and their Approximability Properties, Springer-Verlag, 1999.
6. G. Ausiello, A. D'Atri, M. Protasi, Structure preserving reductions among convex optimization problems, J. Comput. System Sci. 21 (1980) 136-153.
7. R. Balasubramanian, M.R. Fellows, V. Raman, An improved fixed parameter algorithm for vertex cover, Inform. Process. Lett. 65 (1998) 163-168.
8. N. Bansal, V. Raman, Upper bounds for MaxSat: Further improved, in: Proceedings of the 10th International Symposium on Algorithms and Computation, in: Lecture Notes in Computer Science, Vol. 1741, Springer-Verlag, 1999, pp. 247-258.
9. R. Bar-Yehuda, S. Even, A linear-time approximation algorithm for the weighted vertex cover problem, J. Algorithms 2 (1981) 198-203.
10. R. Beigel, Finding maximum independent sets in sparse and general graphs, in: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 856-857.
11. D. Bryant, M. Fellows, V. Raman, U. Stege, On the parameterized complexity of MAST and 3-Hitting Sets, 1998, unpublished manuscript.
12. J. Chen, I. Kanj, W. Jia, Vertex cover: Further observations and further improvements, J. Algorithms 41 (2001) 280-301.
13. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, 1990.
14. P. Crescenzi, V. Kann, A compendium of NP optimization problems, Available at http://www.nada.kth.se/theory/problemlist.html, August 1998.
15. P. Crescenzi, V. Kann, How to find the best approximation results - a follow-up to Garey and Johnson, ACM SIGACT News 29 (1998) 90-97.
16. n algorithm for k-SAT based on local search, Theoret. Comput. Sci. 289 (1) (2002) 69-83.
17. W. Fernandez de la Vega, V.Th. Paschos, R. Saad, Average case analysis of a greedy algorithm for the minimum hitting set problem, in: Proceedings of the 1st Symposium on Latin American Theoretical Informatics, in: Lecture Notes in Computer Science, Vol. 583, Springer-Verlag, 1992, pp. 130-138.
18. R.G. Downey, M.R. Fellows, Parameterized Complexity, Springer-Verlag, 1999.
19. R.G. Downey, M.R. Fellows, Parameterized complexity after (almost) ten years: Review and open questions, in: Combinatorics, Computation & Logic, DMTCS'99 and CATS'99, in: Australian Computer Science Communications, Vol. 21, Springer-Verlag, Singapore, 1999, pp. 1-33.
20. 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, AMS Press, 1999, pp. 49-99.
21. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
22. J. Gramm, E.A. Hirsch, R. Niedermeier, P. Rossmanith, New worst-case upper bounds for MAX-2-SAT with application to MAX-CUT, to appear in Discrete Applied Mathematics. Preliminary version available as ECCC Technical Report R00-037, Trier, Fed. Rep. of Germany, May 2000.
23. D.H. Greene, D.E. Knuth, Mathematics for the Analysis of Algorithms Progress in Computer Science, 2d Edition, Birkhäuser, 1982.
24. M.M. Halldórsson, Approximating k-set cover and complementary graph coloring, in: Proceedings of the 5th International Conference on Integer Programming and Combinatorial Optimization, in: Lecture Notes in Computer Science, Vol. 1084, Springer-Verlag, pp. 118-131.
25. M.M. Halldórsson, K. Tanaka, Approximation and special cases of common subtrees and editing distances, in: Proceedings of the 7th International Symposium on Algorithms and Computation, in: Lecture Notes in Computer Science, Vol. 1178, Springer-Verlag, 1996, pp. 74-84.
26. J. Håstad, Some optimal inapproximability results, J. ACM 48 (2001) 798-859.
27. E.A. Hirsch, New worst-case upper bounds for SAT, J. Automat. Reason. 24 (2000) 397-420.
28. D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston, MA, 1997.
29. 0.304n) algorithm for solving maximum independent set problem, IEEE Trans. Comput. 35 (1986) 847-851.
30. M. Mahajan, V. Raman, Parameterizing above guaranteed values: MaxSat and MaxCut, J. Algorithms 31 (1999) 335-354.
31. R. Niedermeier, Some prospects for efficient fixed parameter algorithms (invited paper), in: Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM), in: Lecture Notes in Computer Science, Vol. 1521, Springer-Verlag, 1998, pp. 168-185.
32. R. Niedermeier, P. Rossmanith, Upper bounds for vertex cover further improved, in: Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, in: Lecture Notes in Computer Science, Vol. 1563, Springer-Verlag, 1999, pp. 561-570.
33. R. Niedermeier, P. Rossmanith, A general method to speed up fixed-parameter-tractable algorithms, Inform. Process. Lett. 73 (2000) 125-129.
34. R. Niedermeier, P. Rossmanith, New upper bounds for maximum satisfiability, J. Algorithms 36 (2000) 63-88.
35. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
36. J.M. Robson, Algorithms for maximum independent sets, J. Algorithms 7 (1986) 425-440.
37. U. Schöning, A probabilistic algorithm for k-SAT and constraint satisfaction problems, in: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, 1999, pp. 410-414.
38. R. Sedgewick, P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, 1996.
39. U. Stege, M. Fellows, An improved fixed-parameter-tractable algorithm for vertex cover, Technical Report 318, Department of Computer Science, ETH Zürich, 1999.
40. R.E. Tarjan, A.E. Trojanowski, Finding a maximum independent set, SIAM J. Comput. 6 (1977) 537-550.