Pages that link to "Item:Q1977137"

The following pages link to Approximation algorithms for minimum \(K\)-cut (Q1977137):

Displaying 29 items.

• Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
• Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
• Approximation algorithms for requirement cut on graphs (Q848961) (← links)
• Approximating \(\alpha\)-cuts with the vertex method (Q1311912) (← links)
• Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
• On cutting a few vertices from a graph (Q1811082) (← links)
• On the \(k\)-cut problem (Q1977642) (← links)
• Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
• I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs (Q2339449) (← links)
• Column-generation based bounds for the homogeneous areas problem (Q2356280) (← links)
• Employee workload balancing by graph partitioning (Q2448894) (← links)
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
• (Q2753925) (← links)
• Tree packing and approximating \(k\)-cuts (Q2768268) (← links)
• How to Cut a Graph into Many Pieces (Q3010400) (← links)
• On the multiway cut polyhedron (Q3971221) (← links)
• (Q4228453) (← links)
• A Polynomial Algorithm for the k-cut Problem for Fixed k (Q4294727) (← links)
• An $\NC$ Algorithm for Minimum Cuts (Q4337444) (← links)
• (Q4357799) (← links)
• (Q4606317) (← links)
• Contribution of copositive formulations to the graph partitioning problem (Q4916308) (← links)
• Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
• Optimal Bounds for the <i>k</i> -cut Problem (Q5066939) (← links)
• A nearly 5/3-approximation FPT Algorithm for Min-<i>k</i>-Cut (Q5146830) (← links)
• Congested Clique Algorithms for the Minimum Cut Problem (Q5197700) (← links)
• An optimal algorithm for the minimum edge cardinality cut surface problem (Q5361640) (← links)
• (Q6059171) (← links)
• Breaking the <i> n ^k </i> barrier for minimum <i>k</i> -cut on simple graphs (Q6083468) (← links)