Cited in
(46)- Lagrangian smoothing heuristics for Max-cut
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- An extended semidefinite relaxation for satisfiability
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Inclusion/exclusion meets measure and conquer
- Improved parameterized set splitting algorithms: A Probabilistic approach
- MAX k‐CUT and approximating the chromatic number of random graphs
- Improved approximations for max set splitting and max NAE SAT
- Global optimality conditions and optimization methods for quadratic integer programming problems
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
- A new discrete filled function method for solving large scale max-cut problems
- A discrete filled function algorithm for approximate global solutions of max-cut problems
- scientific article; zbMATH DE number 2119703 (Why is no real title available?)
- On approximation of max-vertex-cover
- Approximation bounds for sparse principal component analysis
- The hardness of 3-uniform hypergraph coloring
- An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
- Improved parameterized algorithms for above average constraint satisfaction
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Spectral techniques applied to sparse random graphs
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
- Sherali-Adams strikes back
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints
- CirCut
- PASS approximation: a framework for analyzing and designing heuristics
- NOA
- On the optimality of the random hyperplane rounding technique for MAX CUT
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
- Improved Algorithms for Weighted and Unweighted Set Splitting Problems
- Local search to approximate MAX NAE-\(k\)-SAT tightly
- Relations between average case complexity and approximation complexity
- Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems
- On the hardness of efficiently approximating maximal non-\(L\) submatrices.
- An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation
- Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems
- Is constraint satisfaction over two variables always easy?
- Complex semidefinite programming and Max-\(k\)-Cut
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- scientific article; zbMATH DE number 2246591 (Why is no real title available?)
- Approximating Max NAE-\(k\)-SAT by anonymous local search
- An approximation algorithm for scheduling two parallel machines with capacity constraints.
- An improved semidefinite programming relaxation for the satisfiability problem
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Minimizing worst-case and average-case makespan over scenarios
- Approximation algorithm for MAX DICUT with given sizes of parts
This page was built for software: Outward rotations
