The following pages link to (Q4607983):
Displaying 6 items.
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- Faster connectivity in low-rank hypergraphs via expander decomposition (Q2164680) (← links)
- LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- Hypergraph Cuts with General Splitting Functions (Q5094916) (← links)
- A new contraction technique with applications to congruency-constrained cuts (Q5918921) (← links)
