Pages that link to "Item:Q346478"
From MaRDI portal
The following pages link to An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478):
Displaying 4 items.
- Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data (Q2032031) (← links)
- A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem (Q2920470) (← links)
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance (Q3057151) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q5176000) (← links)