Pages that link to "Item:Q1977137"
From MaRDI portal
The following pages link to Approximation algorithms for minimum \(K\)-cut (Q1977137):
Displaying 8 items.
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← 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)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- Contribution of copositive formulations to the graph partitioning problem (Q4916308) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
