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
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for MAX SAT
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Combinatorial approximation algorithms for the maximum directed cut problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Constructing worst case instances for semidefinite programming based approximation algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
On the integrality ratio of semidefinite relaxations of MAX CUT
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Some optimal inapproximability results
Journal of the ACM (JACM)
Computer assisted proof of optimal approximability results
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation of max-cut on graphs of bounded degree
Journal of Algorithms
Relaxations of the Satisfiability Problem Using Semidefinite Programming
Journal of Automated Reasoning
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
On the optimality of the random hyperplane rounding technique for max cut
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection
Journal of Global Optimization
Improved approximation algorithms for MAX SAT
Journal of Algorithms
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Heuristics for Improving the Non-oblivious Local Search for MaxSAT
IBERAMIA '98 Proceedings of the 6th Ibero-American Conference on AI: Progress in Artificial Intelligence
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The RPR2 Rounding Technique for Semidefinite Programs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An approximation algorithm for MAX DICUT with given sizes of parts
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Inapproximability results for set splitting and satisfiability problems with no mixed clauses
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
The Non-approximability of Non-Boolean Predicates
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
63-Approximation Algorithm for MAX DICUT
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Algorithms Based on Randomization and Linear and Semidefinite Programming
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Faster Exact Solutions for MAX2SAT
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for the maximum satisfiability problem
Nordic Journal of Computing
Randomized approximations of the constraint satisfaction problem
Nordic Journal of Computing
A combinatorial algorithm for MAX CSP
Information Processing Letters
Discrete Applied Mathematics
Tight Bound on Johnson's Algoritihm for Max-SAT
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor
Information Processing Letters
Journal of Global Optimization
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
Bipartite Subgraphs and the Smallest Eigenvalue
Combinatorics, Probability and Computing
The Difficulty of Reduced Error Pruning of Leveled Branching Programs
Annals of Mathematics and Artificial Intelligence
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Journal of Computer and System Sciences - STOC 2001
Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution
IEEE Transactions on Knowledge and Data Engineering
On approximating minimum vertex cover for graphs with perfect matching
Theoretical Computer Science
Semidefinite programming based approaches to the break minimization problem
Computers and Operations Research
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
The RPR2 rounding technique for semidefinite programs
Journal of Algorithms
GRASP with path relinking for the weighted MAXSAT problem
Journal of Experimental Algorithmics (JEA)
Balanced max 2-sat might not be the hardest
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Computing the types of the relationships between autonomous systems
IEEE/ACM Transactions on Networking (TON)
Near-optimal algorithms for maximum constraint satisfaction problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Information Processing Letters
An efficient solver for weighted Max-SAT
Journal of Global Optimization
Sums of squares based approximation algorithms for MAX-SAT
Discrete Applied Mathematics
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
Computational Complexity
Randomized Competitive Analysis for Two-Server Problems
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing
Near-optimal algorithms for maximum constraint satisfaction problems
ACM Transactions on Algorithms (TALG)
Local search starting from an LP solution: Fast and quite good
Journal of Experimental Algorithmics (JEA)
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A theory of loss-leaders: making money by pricing below cost
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
The UGC Hardness Threshold of the Lp Grothendieck Problem
Mathematics of Operations Research
Decision-theoretic Optimal Sampling in Hidden Markov Random Fields
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Improved orientations of physical networks
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Submodular secretary problem and extensions
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
SIAM Journal on Discrete Mathematics
Tight bounds on local search to approximate the maximum satisfiability problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
SIAM Journal on Computing
Maximizing Non-monotone Submodular Functions
SIAM Journal on Computing
Improved approximation algorithms for MAX NAE-SAT and MAX SAT
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Sums of squares, satisfiability and maximum satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Rounding two and three dimensional solutions of the SDP relaxation of MAX CUT
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Randomized variants of Johnson's algorithm for MAX SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Submodular maximization by simulated annealing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
GRASP with path-relinking for the weighted maximum satisfiability problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
On the relative merits of simple local search methods for the MAX-SAT problem
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
The power of semidefinite programming relaxations for MAX-SAT
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Finite-State online algorithms and their automated competitive analysis
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Journal of Combinatorial Optimization
Approximating MAX SAT by moderately exponential and parameterized algorithms
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Improved approximation for orienting mixed graphs
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Approximate MRF inference using bounded treewidth subgraphs
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Submodular secretary problem and extensions
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
Abstract: It is well known that two prover proof systems are a convenient tool for establishing hardness of approximation results. In this paper, we show that two prover proof systems are also convenient starting points for establishing easiness of approximation results. Our approach combines the Feige-Lovasz (STOC92) semidefinite programming relaxation of one-round two-prover proof systems, together with rounding techniques for the solutions of semidefinite programs, as introduced by Goemans and Williamson (STOC94). As a consequence of our approach, we present improved approximation algorithms for MAX 2SAT and MAX DICUT. The algorithms are guaranteed to deliver solutions within a factor of 0.931 of the optimum for MAX 2SAT and within a factor of 0.859 for MAX DICUT, improving upon the guarantees of 0.878 and 0.796 of Goemans and Williamson (1994).