Pages that link to "Item:Q5140849"
From MaRDI portal
The following pages link to On the hardness of approximating the \(k\)-\textsc{Way Hypergraph Cut} problem (Q5140849):
Displaying 4 items.
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- (Q4607983) (← links)
- Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
- Approximating submodular \(k\)-partition via principal partition sequence (Q6654129) (← links)