An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
From MaRDI portal
(Redirected from Publication:346478)
Recommendations
- A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem
- Complex semidefinite programming and Max-\(k\)-Cut
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
- Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation
- On approximation of max \(\frac{n}{2}\)-uncut problem
Cites work
- scientific article; zbMATH DE number 1304324 (Why is no real title available?)
- scientific article; zbMATH DE number 1305507 (Why is no real title available?)
- A .699-approximation algorithm for Max-Bisection.
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- An approximation algorithm for max k-uncut with capacity constraints
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- An improved rounding method and semidefinite programming relaxation for graph partition
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
- Approximating CSPs with global cardinality constraints using SDP hierarchies
- Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection
- Complex Quadratic Optimization and Semidefinite Programming
- Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- One-Half Approximation Algorithms for the k-Partition Problem
- Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems
- P-Complete Approximation Problems
- Segmentation problems
- The RPR2 rounding technique for semidefinite programs
Cited in
(7)- Positive semidefinite relaxation and approximation algorithm for triple patterning lithography
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
- Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
- Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation
- A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
This page was built for publication: An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346478)
