Approximation algorithms for minimum \(K\)-cut

DOI10.1007/s004530010013zbMath0951.68178OpenAlexW2081846387MaRDI QIDQ1977137

Refael Hassin, Nili Guttmann-Beck

Publication date: 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010013

zbMATH Keywords

minimum \(K\)-cut problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (8)

Semidefinite approximations for quadratic programs over orthogonal matrices ⋮ Cardinality constrained minimum cut problems: complexity and algorithms. ⋮ Employee workload balancing by graph partitioning ⋮ How to Cut a Graph into Many Pieces ⋮ Contribution of copositive formulations to the graph partitioning problem ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Simplex Transformations and the Multiway Cut Problem ⋮ Column-generation based bounds for the homogeneous areas problem

This page was built for publication: Approximation algorithms for minimum \(K\)-cut