On the approximation of maximum satisfiability
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Approximability of maximum splitting of k-sets and some other Apx-complete problems
Information Processing Letters
How good is the Goemans-Williamson MAX CUT algorithm?
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
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
Better approximation algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT
Information Processing Letters
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximating Satisfiable Satisfiability Problems (Extended Abstract)
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Derandomizing semidefinite programming based approximation algorithms
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
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)
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Bipartite Subgraphs and the Smallest Eigenvalue
Combinatorics, Probability and Computing
Improved approximation algorithms for MAX SAT
SODA '00 Proceedings of the eleventh 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)
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
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computer assisted proof of optimal approximability results
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On Semidefinite Programming Relaxations of (2+p)-SAT
Annals of Mathematics and Artificial Intelligence
Improved approximation of max-cut on graphs of bounded degree
Journal of Algorithms
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
The RPR2 Rounding Technique for Semidefinite Programs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
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
The side-chain positioning problem: a semidefinite programming formulation with new rounding schemes
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Journal of Global Optimization
An approximation algorithm for scheduling two parallel machines with capacity constraints
Discrete Applied Mathematics
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Journal of Computer and System Sciences - STOC 2001
Approximating the cut-norm via Grothendieck's inequality
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Is constraint satisfaction over two variables always easy?
Random Structures & Algorithms
Journal of Algorithms
Every 2-CSP allows nontrivial approximation
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Spectral and meta-heuristic algorithms for software clustering
Journal of Systems and Software - Special issue: Software reverse engineering
Lagrangian Smoothing Heuristics for Max-Cut
Journal of Heuristics
MAX k-CUT and approximating the chromatic number of random graphs
Random Structures & Algorithms
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
A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies
INFORMS Journal on Computing
Approximating the fixed linear crossing number
Discrete Applied Mathematics
An optimal sdp algorithm for max-cut, and equally optimal long code tests
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Some topics in analysis of boolean functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Efficiently solving convex relaxations for MAP estimation
Proceedings of the 25th international conference on Machine learning
A discrete filled function algorithm for approximate global solutions of max-cut problems
Journal of Computational and Applied Mathematics
Fast SDP algorithms for constraint satisfaction problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Global optimality conditions and optimization methods for quadratic integer programming problems
Journal of Global Optimization
ESA'11 Proceedings of the 19th European conference on Algorithms
Approximating Max kCSP - outperforming a random assignment with almost a linear factor
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Improved approximation algorithms for MAX NAE-SAT and MAX SAT
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
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
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
A new discrete filled function method for solving large scale max-cut problems
Numerical Algorithms
Improved algorithms for weighted and unweighted set splitting problems
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Journal of Combinatorial Optimization
| Hi-index | 0.00 |