Pages that link to "Item:Q4925247"
From MaRDI portal
The following pages link to An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems (Q4925247):
Displaying 5 items.
- Better approximation algorithms for influence maximization in online social networks (Q2352355) (← links)
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294) (← links)
- A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem (Q2920470) (← links)
- An Enhancement of the Bisection Method Average Performance Preserving Minmax Optimality (Q5025219) (← links)
- (Q5499455) (← links)