The following pages link to Outward rotations (Q20665):
Displaying 44 items.
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- A new discrete filled function method for solving large scale max-cut problems (Q438797) (← links)
- Approximation bounds for sparse principal component analysis (Q484129) (← links)
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
- A discrete filled function algorithm for approximate global solutions of max-cut problems (Q939569) (← links)
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (Q1014949) (← links)
- Improved parameterized set splitting algorithms: A Probabilistic approach (Q1040647) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- On the hardness of efficiently approximating maximal non-\(L\) submatrices. (Q1418978) (← links)
- Aspects of semidefinite programming. Interior point algorithms and selected applications (Q1597978) (← links)
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
- Approximation algorithm for MAX DICUT with given sizes of parts (Q1879136) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- PASS approximation: a framework for analyzing and designing heuristics (Q1950388) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation (Q2358849) (← links)
- The hardness of 3-uniform hypergraph coloring (Q2368586) (← links)
- An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT (Q2368971) (← links)
- Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (Q2444145) (← links)
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
- Lagrangian smoothing heuristics for Max-cut (Q2491324) (← links)
- Outward rotations (Q2819597) (← links)
- Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
- Is constraint satisfaction over two variables always easy? (Q3156915) (← links)
- Local Search to Approximate Max NAE-$$k$$-Sat Tightly (Q3452574) (← links)
- (Q3515551) (← links)
- Relations between average case complexity and approximation complexity (Q3579211) (← links)
- Improved Algorithms for Weighted and Unweighted Set Splitting Problems (Q3608877) (← links)
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems (Q4537628) (← links)
- On the optimality of the random hyperplane rounding technique for MAX CUT (Q4537629) (← links)
- (Q4828974) (← links)
- (Q5158503) (← links)
- (Q5240428) (← links)
- Spectral techniques applied to sparse random graphs (Q5318249) (← links)
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? (Q5454254) (← links)
- MAX <i>k</i>‐CUT and approximating the chromatic number of random graphs (Q5471049) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479355) (← links)
- (Q5717954) (← links)
