Faster exact solutions for some NP-hard problems

Limor Drori; David Peleg

doi:10.1016/s0304-3975(01)00257-2

Faster exact solutions for some NP-hard problems

Limor Drori
, David Peleg

Department of Mathematics and Computer Sciences
Weizmann Institute of Science

Research output: Contribution to journal › Conference article › peer-review

16 Scopus citations

Abstract

This paper considers a number of NP-complete problems, and provides faster algorithms for solving them. 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.

Original language	English
Pages (from-to)	473-499
Number of pages	27
Journal	Theoretical Computer Science
Volume	287
Issue number	2
DOIs	https://doi.org/10.1016/s0304-3975(01)00257-2
State	Published - 28 Sep 2002
Externally published	Yes
Event	Algorthims (ESA'99) - Prague, Czech Republic Duration: 16 Jul 1999 → 18 Jul 1999

Bibliographical note

Funding Information:
∗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.

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
Israel Ministry and Art
Israel Science Foundation

Access to Document

10.1016/s0304-3975(01)00257-2

Cite this

@article{0360275ac9d148cd97e9fe8f64ed362a,

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

author = "Limor Drori and David Peleg",

note = "Funding Information: ∗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.; Algorthims (ESA'99) ; Conference date: 16-07-1999 Through 18-07-1999",

year = "2002",

month = sep,

day = "28",

doi = "10.1016/s0304-3975(01)00257-2",

language = "אנגלית",

volume = "287",

pages = "473--499",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Faster exact solutions for some NP-hard problems

AU - Drori, Limor

AU - Peleg, David

N1 - Funding Information: ∗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.

PY - 2002/9/28

Y1 - 2002/9/28

N2 - This paper considers a number of NP-complete problems, and provides faster algorithms for solving them. 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.

AB - This paper considers a number of NP-complete problems, and provides faster algorithms for solving them. 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.

UR - https://www.scopus.com/pages/publications/0037190359

U2 - 10.1016/s0304-3975(01)00257-2

DO - 10.1016/s0304-3975(01)00257-2

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0037190359

SN - 0304-3975

VL - 287

SP - 473

EP - 499

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 2

T2 - Algorthims (ESA'99)

Y2 - 16 July 1999 through 18 July 1999

ER -

Faster exact solutions for some NP-hard problems

Abstract

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this