The following pages link to (Q2753920):
Displaying 8 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)
- (Q4607983) (← links)
- An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications (Q4806910) (← links)
- A Heuristic Solution of a Cutting Problem Using Hypergraphs (Q4915264) (← links)
- Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. (Q6084360) (← links)
