TY - INPR
A1 - Bruglieri, Maurizio
A1 - Ehrgott, Matthias
A1 - Hamacher, Horst W.
T1 - Some Complexity Results for k-Cardinality Minimum Cut Problems
N2 - Many polynomially solvable combinatorial optimization problems (COP) become NP when we require solutions to satisfy an additional cardinality constraint. This family of problems has been considered only recently. We study a newproblem of this family: the k-cardinality minimum cut problem. Given an undirected edge-weighted graph the k-cardinality minimum cut problem is to find a partition of the vertex set V in two sets V 1 , V 2 such that the number of the edges between V 1 and V 2 is exactly k and the sum of the weights of these edges is minimal. A variant of this problem is the k-cardinality minimum s-t cut problem where s and t are fixed vertices and we have the additional request that s belongs to V 1 and t belongs to V 2 . We also consider other variants where the number of edges of the cut is constrained to be either less or greater than k. For all these problems we show complexity results in the most significant graph classes.
T3 - Report in Wirtschaftsmathematik (WIMA Report) - 69
KW - k-cardinality minimum cut
KW - cardinality constraint combinatorial optimization
KW - computational complexity
Y1 - 2000
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1140
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-10788
ER -