Pages that link to "Item:Q1887719"
From MaRDI portal
The following pages link to Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719):
Displaying 16 items.
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization (Q526833) (← links)
- Approximation algorithms for indefinite complex quadratic maximization problems (Q625875) (← links)
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728) (← links)
- On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200) (← links)
- The capacitated max \(k\)-cut problem (Q930343) (← links)
- Conic stability of polynomials and positive maps (Q1996086) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
- Frequency-hopping code design for Target detection via optimization theory (Q2275335) (← links)
- Phase recovery, MaxCut and complex semidefinite programming (Q2515033) (← links)
- Approximating projections by quantum operations (Q2685389) (← links)
- A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
- New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover (Q2943894) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
