Pages that link to "Item:Q2456360"
From MaRDI portal
The following pages link to Approximation algorithms for maximum cut with limited unbalance (Q2456360):
Displayed 7 items.
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518) (← links)
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance (Q3057151) (← links)
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)