Implications of forbidden structures for extremal algorithmic problems
Theoretical Computer Science
Journal of Combinatorial Theory Series A
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The steiner problem with edge lengths 1 and 2,
Information Processing Letters
On the complexity of approximating the independent set problem
Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Linear approximation of shortest superstrings
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Maximum bounded 3-dimensional matching is MAX SNP-complete
Information Processing Letters
Approximation and Intractability Results for the Maximum Cut Problem and Its Variants
IEEE Transactions on Computers
The traveling salesman problem with distances one and two
Mathematics of Operations Research
Approximation alogorithms for the maximum acyclic subgraph problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
P-Complete Approximation Problems
Journal of the ACM (JACM)
Complexity of Partial Satisfaction
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximating the throughput of multiple machines under real-time scheduling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering for VLSI Applications
IEEE Transactions on Computers
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The complexity of approximating pspace-complete problems for hierarchical specifications
Nordic Journal of Computing
Approximation algorithms for the maximum satisfiability problem
Nordic Journal of Computing
Locally consistent constraint satisfaction problems
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
GRASP with path relinking for the weighted MAXSAT problem
Journal of Experimental Algorithmics (JEA)
SOFIE: a self-organizing framework for information extraction
Proceedings of the 18th international conference on World wide web
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
GRASP with path-relinking for the weighted maximum satisfiability problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
On dependent randomized rounding algorithms
Operations Research Letters
A new algorithm for parameterized MAX-SAT
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
| Hi-index | 0.00 |
We present a 3/4 polynomial time approximation algorithm for the Maximum Satisfiability problem: Given a set of clauses, find a truth assignment that satisfies the maximum number of clauses. The algorithm applies to the weighted case as well, and involves nontrival application of network flow techniques.