Outward rotations

swMATH8660MaRDI QIDQ20665FDOQ20665

Author name not available (Why is that?)

Cited In (44)

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

This page was built for software: Outward rotations