Pages that link to "Item:Q2354294"

The following pages link to An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294):

Displaying 1 item.

• An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)