Faster exact solutions for some NP-hard problems

Limor Drori; David Peleg

doi:10.1007/3-540-48481-7_39

Faster exact solutions for some NP-hard problems

Limor Drori, David Peleg

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

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 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 language	English
Title of host publication	Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings
Editors	Jaroslav Nešetřil
Publisher	Springer Verlag
Pages	450-461
Number of pages	12
ISBN (Print)	3540662510, 9783540662518
DOIs	https://doi.org/10.1007/3-540-48481-7_39
State	Published - 1999
Externally published	Yes
Event	7th Annual European Symposium on Algorithms, ESA 1999 - Prague, Czech Republic Duration: 16 Jul 1999 → 18 Jul 1999

Publication series

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

Conference

Conference	7th Annual European Symposium on Algorithms, ESA 1999
Country/Territory	Czech Republic
City	Prague
Period	16/07/99 → 18/07/99

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.

Funding

∗Corresponding author. E-mail addresses: [email protected] (L. Drori), [email protected] (D. Peleg). 1Supported in part by grants from the Israel Science Foundation and the Israel Ministry and Art.

Funders	Funder number
Israel Ministry and Art
Israel Science Foundation

Access to Document

10.1007/3-540-48481-7_39

Cite this

Drori, L., & Peleg, D. (1999). Faster exact solutions for some NP-hard problems. In J. Nešetřil (Ed.), Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings (pp. 450-461). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1643). Springer Verlag. https://doi.org/10.1007/3-540-48481-7_39

@inproceedings{89d0c307c048454c994d69ca63c1d50b,

title = "Faster exact solutions for some NP-hard problems",

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 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.",

author = "Limor Drori and David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 7th Annual European Symposium on Algorithms, ESA 1999 ; Conference date: 16-07-1999 Through 18-07-1999",

year = "1999",

doi = "10.1007/3-540-48481-7_39",

language = "אנגלית",

isbn = "3540662510",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "450--461",

editor = "Jaroslav Ne{\v s}et{\v r}il",

booktitle = "Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings",

address = "גרמניה",

}

Drori, L & Peleg, D 1999, Faster exact solutions for some NP-hard problems. in J Nešetřil (ed.), Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1643, Springer Verlag, pp. 450-461, 7th Annual European Symposium on Algorithms, ESA 1999, Prague, Czech Republic, 16/07/99. https://doi.org/10.1007/3-540-48481-7_39

Faster exact solutions for some NP-hard problems. / Drori, Limor; Peleg, David.
Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. ed. / Jaroslav Nešetřil. Springer Verlag, 1999. p. 450-461 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1643).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Faster exact solutions for some NP-hard problems

AU - Drori, Limor

AU - Peleg, David

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84958060435&partnerID=8YFLogxK

U2 - 10.1007/3-540-48481-7_39

DO - 10.1007/3-540-48481-7_39

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84958060435

SN - 3540662510

SN - 9783540662518

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

SP - 450

EP - 461

BT - Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings

A2 - Nešetřil, Jaroslav

PB - Springer Verlag

T2 - 7th Annual European Symposium on Algorithms, ESA 1999

Y2 - 16 July 1999 through 18 July 1999

ER -

Faster exact solutions for some NP-hard problems

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this