Pages that link to "Item:Q3637068"

The following pages link to Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation (Q3637068):

Displaying 3 items.

• An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
• A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section (Q1954820) (← links)
• (Q5240428) (← links)