Pages that link to "Item:Q2018887"
From MaRDI portal
The following pages link to An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887):
Displaying 7 items.
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
- On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model (Q2031482) (← links)
- A bound on judicious bipartitions of directed graphs (Q2303909) (← links)
- Unbalanced graph cuts with minimum capacity (Q2515430) (← links)
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance (Q3057151) (← links)
- On the optimality of the random hyperplane rounding technique for MAX CUT (Q4537629) (← links)
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)