Pages that link to "Item:Q1769071"

The following pages link to Greedy splitting algorithms for approximating multiway partition problems (Q1769071):

Displaying 19 items.

• Algorithmic aspects of homophyly of networks (Q501003) (← links)
• Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844) (← links)
• Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
• New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
• Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
• On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
• Exploiting structure of chance constrained programs via submodularity (Q2280674) (← links)
• Approximation algorithms for vertex happiness (Q2326078) (← links)
• Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
• (Q2766993) (← links)
• Submodular Cost Allocation Problem and Applications (Q3012819) (← 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)
• Fixed parameter approximation scheme for min-max \(k\)-cut (Q5918433) (← links)
• Fixed parameter approximation scheme for min-max \(k\)-cut (Q5925652) (← 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)