Some Complexity Results for k-Cardinality Minimum Cut Problems

  • 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.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Maurizio Bruglieri, Matthias Ehrgott, Horst W. Hamacher
URN (permanent link):urn:nbn:de:hbz:386-kluedo-10788
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (69)
Document Type:Preprint
Language of publication:English
Year of Completion:2000
Year of Publication:2000
Publishing Institute:Technische Universität Kaiserslautern
Tag:cardinality constraint combinatorial optimization ; computational complexity; k-cardinality minimum cut
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik

$Rev: 12793 $