Pages that link to "Item:Q2428700"

The following pages link to Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700):

Displaying 13 items.

• Improving graph partitions using submodular functions. (Q1410700) (← links)
• Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
• 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)
• (Q4281517) (← links)
• Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
• On the hardness of approximating the \(k\)-\textsc{Way Hypergraph Cut} problem (Q5140849) (← links)
• Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
• Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6608037) (← links)
• A polynomial time algorithm for finding a minimum 4-partition of a submodular function (Q6608049) (← links)
• Approximating submodular \(k\)-partition via principal partition sequence (Q6654129) (← links)