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