The following pages link to (Q2753920):
Displayed 4 items.
- The capacitated max \(k\)-cut problem (Q930343) (← links)
- Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Randomized Rounding in the Presence of a Cardinality Constraint (Q2828177) (← links)