Pages that link to "Item:Q2920470"
From MaRDI portal
The following pages link to A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem (Q2920470):
Displaying 5 items.
- Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)
- Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← 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)