Pages that link to "Item:Q2920470"

The following pages link to A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem (Q2920470):

Displaying 3 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)