Outward rotations
From MaRDI portal
Publication:2819597
DOI10.1145/301250.301431zbMath1345.90064OpenAlexW2026820987MaRDI QIDQ2819597
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301431
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Connectivity (05C40)
Related Items (34)
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 ⋮ 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 ⋮ Approximating the fixed linear crossing number ⋮ Approximation bounds for sparse principal component analysis ⋮ A discrete filled function algorithm for approximate global solutions of max-cut problems ⋮ Approximating Max NAE-\(k\)-SAT by anonymous local search ⋮ Approximating the 2-catalog segmentation problem using semidefinite programming relaxations ⋮ Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation ⋮ Inclusion/exclusion meets measure and conquer ⋮ 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 ⋮ A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems ⋮ Improved parameterized set splitting algorithms: A Probabilistic approach ⋮ On approximation of max-vertex-cover ⋮ Unnamed Item
Uses Software
This page was built for publication: Outward rotations
