The following pages link to (Q4251055):
Displaying 14 items.
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- The capacitated max \(k\)-cut problem (Q930343) (← links)
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (Q1924622) (← links)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section (Q1954820) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
- Is constraint satisfaction over two variables always easy? (Q3156915) (← links)
- An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074) (← links)
- (Q3573969) (← links)
- (Q4900961) (← links)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287) (← links)
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)
