Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Exact 3-Satisfiability Is Decidable in Time O(20.16254n)
Annals of Mathematics and Artificial Intelligence
Efficient self-organized backbone formation in mobile ad hoc networks (MANETs)
Computers and Electrical Engineering
Ad hoc node connectivity improvement analysis - Why not through mesh clients?
Computers and Electrical Engineering
Hi-index | 0.00 |
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 O 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.