Pages that link to "Item:Q2354294"
From MaRDI portal
The following pages link to An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294):
Displaying 7 items.
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- An improved rounding method and semidefinite programming relaxation for graph partition (Q1849503) (← links)
- A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem (Q2920470) (← links)
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems (Q4537628) (← links)
- An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems (Q4925247) (← links)
- An Enhancement of the Bisection Method Average Performance Preserving Minmax Optimality (Q5025219) (← links)
- (Q5499455) (← links)