Pages that link to "Item:Q2428700"
From MaRDI portal
The following pages link to Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700):
Displaying 7 items.
- Computing minimum multiway cuts in hypergraphs (Q1799394) (← links)
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
- (Q5140849) (← links)
- Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)