On the approximation of maximum satisfiability
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Tight bound on Johnson's algorithm for maximum satisfiability
Journal of Computer and System Sciences
Some optimal inapproximability results
Journal of the ACM (JACM)
Improved approximation algorithms for MAX SAT
Journal of Algorithms
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Simplified tight analysis of Johnson's algorithm
Information Processing Letters
Random MAX SAT, random MAX CUT, and their phase transitions
Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part II
An improved approximation algorithm for combinatorial auctions with submodular bidders
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
Proceedings of the 9th ACM conference on Electronic commerce
Maximizing submodular set functions subject to multiple linear constraints
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Two-query PCP with subconstant error
Journal of the ACM (JACM)
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Randomized variants of Johnson's algorithm for MAX SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters
Bounds on greedy algorithms for MAX SAT
ESA'11 Proceedings of the 19th European conference on Algorithms
| Hi-index | 0.00 |
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.