Submodular Max-SAT

Yossi Azar; Iftah Gamzu; Ran Roth

doi:10.1007/978-3-642-23719-5_28

Submodular Max-SAT

Yossi Azar, Iftah Gamzu, Ran Roth

School of Computer Science

Tel Aviv University

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

Abstract

We introduce the submodular Max-SAT problem. This problem is a natural generalization of the classical Max-SAT problem in which the additive objective function is replaced by a submodular one. We develop a randomized linear-time 2/3-approximation algorithm for the problem. Our algorithm is applicable even for the online variant of the problem. We also establish hardness results for both the online and offline settings. Notably, for the online setting, the hardness result proves that our algorithm is best possible, while for the offline setting, the hardness result establishes a computational separation between the classical Max-SAT and the submodular Max-SAT.

Original language	English
Title of host publication	Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings
Pages	323-334
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-23719-5_28
State	Published - 2011
Event	19th Annual European Symposium on Algorithms, ESA 2011 - Saarbrucken, Germany Duration: 5 Sep 2011 → 9 Sep 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6942 LNCS

Conference

Conference	19th Annual European Symposium on Algorithms, ESA 2011
Country/Territory	Germany
City	Saarbrucken
Period	5/09/11 → 9/09/11

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-23719-5_28

Cite this

@inproceedings{2c5fb470597d448eb901371fd0552e73,

title = "Submodular Max-SAT",

abstract = "We introduce the submodular Max-SAT problem. This problem is a natural generalization of the classical Max-SAT problem in which the additive objective function is replaced by a submodular one. We develop a randomized linear-time 2/3-approximation algorithm for the problem. Our algorithm is applicable even for the online variant of the problem. We also establish hardness results for both the online and offline settings. Notably, for the online setting, the hardness result proves that our algorithm is best possible, while for the offline setting, the hardness result establishes a computational separation between the classical Max-SAT and the submodular Max-SAT.",

author = "Yossi Azar and Iftah Gamzu and Ran Roth",

year = "2011",

doi = "10.1007/978-3-642-23719-5\_28",

language = "الإنجليزيّة",

isbn = "9783642237188",

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

pages = "323--334",

booktitle = "Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings",

note = "19th Annual European Symposium on Algorithms, ESA 2011 ; Conference date: 05-09-2011 Through 09-09-2011",

}

Azar, Y, Gamzu, I & Roth, R 2011, Submodular Max-SAT. in Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6942 LNCS, pp. 323-334, 19th Annual European Symposium on Algorithms, ESA 2011, Saarbrucken, Germany, 5/09/11. https://doi.org/10.1007/978-3-642-23719-5_28

Submodular Max-SAT. / Azar, Yossi; Gamzu, Iftah; Roth, Ran.
Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. 2011. p. 323-334 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6942 LNCS).

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

TY - GEN

T1 - Submodular Max-SAT

AU - Azar, Yossi

AU - Gamzu, Iftah

AU - Roth, Ran

PY - 2011

Y1 - 2011

N2 - We introduce the submodular Max-SAT problem. This problem is a natural generalization of the classical Max-SAT problem in which the additive objective function is replaced by a submodular one. We develop a randomized linear-time 2/3-approximation algorithm for the problem. Our algorithm is applicable even for the online variant of the problem. We also establish hardness results for both the online and offline settings. Notably, for the online setting, the hardness result proves that our algorithm is best possible, while for the offline setting, the hardness result establishes a computational separation between the classical Max-SAT and the submodular Max-SAT.

AB - We introduce the submodular Max-SAT problem. This problem is a natural generalization of the classical Max-SAT problem in which the additive objective function is replaced by a submodular one. We develop a randomized linear-time 2/3-approximation algorithm for the problem. Our algorithm is applicable even for the online variant of the problem. We also establish hardness results for both the online and offline settings. Notably, for the online setting, the hardness result proves that our algorithm is best possible, while for the offline setting, the hardness result establishes a computational separation between the classical Max-SAT and the submodular Max-SAT.

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

U2 - 10.1007/978-3-642-23719-5_28

DO - 10.1007/978-3-642-23719-5_28

M3 - منشور من مؤتمر

SN - 9783642237188

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

SP - 323

EP - 334

BT - Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings

T2 - 19th Annual European Symposium on Algorithms, ESA 2011

Y2 - 5 September 2011 through 9 September 2011

ER -

Submodular Max-SAT

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this