Abstract
This paper considers a number of NP-complete problems, and provides faster algorithms for solving them exactly. The solutions are based on a recursive partitioning of the problem domain, and careful elimination of some of the branches along the search without actually checking them. The time complexity of the proposed algorithms is of the form O(2∈n) for constant 0 < ∈ < 1, where n is the output size of the problem. In particular, such algorithms are presented for the Exact SAT and Exact Hitting Set problems (with ∈ = 0:3212), and for the Exact 3SAT problem (with ∈ = 0:2072). Both algorithms improve on previous ones proposed in the literature.
Supported in part by a grant from the Israel Ministry of Science and Art.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Drori and D. Peleg. Improved Exact Solutions for Exact Hitting Set and Related Problems. Unpublished manuscript, March. 1999.
A. Ferreira. On space-efficient algorithms for certain NP-complete problems. Theoret. Computer Sci., 120:311–315, 1993.
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.
Edward A. Hirsch. Two new upper bounds for SAT. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, pages 521–530, January 1998.
Tang Jian. An O(20.304n) algorithm for solving maximum independent set problem. IEEE Trans. on Communication, 35:847–851, September 1986.
O. Kullmann.Worst-case analysis, 3-sat decision and lower bounds: approaches for improved sat algorithms. In DIMACS SAT Workshop, 1996.
O. Kullmann and H. Luckhardt. Deciding propositional tautologies: Algorithms and their complexity. Unpublished manuscript, 1997.
B. Monien and E. Speckenmeyer. Solving satisfiability in less than 2n steps. Discrete Applied Mathematics, 10:287–295, April 1985.
J. M. Robson. Algorithms for Maximum Independent Sets. Journal of Algorithms, 7:425–440, 1986.
I. Schiermeyer. Pure literal look ahead:AnO(1.497n) 3-satisfiability algorithm. In Workshop on the Satisfiability Problem, 1996.
R. Schroeppel and A. Shamir. A T = O(2n/2), S = O(2n/4) algorithm for certain NPcomplete problems. SIAM J. on Computing, 10:456–464, 1981.
Robert E. Tarjan and Anthony E. Trojanowski. Finding a maximum independent set. SIAM J. on Computing, 6:537–546, September 1977.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drori, L., Peleg, D. (1999). Faster Exact Solutions for Some NP-Hard Problems. In: Nešetřil, J. (eds) Algorithms - ESA’ 99. ESA 1999. Lecture Notes in Computer Science, vol 1643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_39
Download citation
DOI: https://doi.org/10.1007/3-540-48481-7_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66251-8
Online ISBN: 978-3-540-48481-3
eBook Packages: Springer Book Archive