Faster exact solutions for some NP-hard problems

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

Volumn 1643, Issue , 1999, Pages 450-461

  Drori, Limor ^a   Peleg, David ^b  

^a Applied Materials Inc Israel   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; REGRESSION ANALYSIS;

3-SAT PROBLEMS; EXACT SOLUTION; HITTING SET PROBLEMS; PROBLEM DOMAIN; RECURSIVE PARTITIONING; TIME COMPLEXITY;

ALGORITHMS;

EID: 84958060435     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_39     Document Type: Conference Paper

References (12)

1. L. Drori and D. Peleg. Improved Exact Solutions for Exact Hitting Set and Related Problems. Unpublished manuscript, March. 1999.
2. A. Ferreira. On space-efficient algorithms for certain NP-complete problems. Theoret. Computer Sci., 120:311-315, 1993.
3. M.R. Garey and D.S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco, CA, 1979.
4. Edward A. Hirsch. Two new upper bounds for SAT. In Proc. 9th ACM-SIAM Symp. On Discrete Algorithms, pages 521-530, January 1998.
5. 0. 304n) algorithm for solving maximum independent set problem. IEEE Trans. on Communication, 35:847-851, September 1986.
6. O. Kullmann. Worst-case analysis, 3-sat decision and lower bounds: approaches for improved sat algorithms. In DIMACS SAT Workshop, 1996.
7. O. Kullmann and H. Luckhardt. Deciding propositional tautologies: Algorithms and their complexity. Unpublished manuscript, 1997.
8. n steps. Discrete Applied Mathematics, 10:287-295, April 1985.
9. J.M. Robson. Algorithms for Maximum Independent Sets. Journal of Algorithms, 7:425-440, 1986.
10. n) 3-satisfiability algorithm. In Workshop on the Satisfiability Problem, 1996.
11. n/4) algorithm for certain NP-complete problems. SIAMJ. on Computing, 10:456-464, 1981.
12. Robert E. Tarjan and Anthony E. Trojanowski. Finding a maximum independent set. SIAM J. on Computing, 6:537-546, September 1977.