Faster exact solutions for some NP-hard problems

Limor Drori, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations


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 0(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.

Original languageEnglish
Title of host publicationAlgorithms - ESA 1999 - 7th Annual European Symposium, Proceedings
EditorsJaroslav Nešetřil
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540662510, 9783540662518
StatePublished - 1999
Externally publishedYes
Event7th Annual European Symposium on Algorithms, ESA 1999 - Prague, Czech Republic
Duration: 16 Jul 199918 Jul 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference7th Annual European Symposium on Algorithms, ESA 1999
Country/TerritoryCzech Republic

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.


Dive into the research topics of 'Faster exact solutions for some NP-hard problems'. Together they form a unique fingerprint.

Cite this