Cardinality constrained minimum cut problems: complexity and algorithms
Under an Elsevier user license
open archive
Keywords
Cut problems
k-cardinality minimum cut
Cardinality constrained combinatorial optimization
Computational complexity
Semidefinite programming
Cited by (0)
- 1
The work of M.B. has been supported by Ph.D. MA.C.R.O. Grant of the Department of Mathematics “F. Enriquez”, University of Milan.
Copyright © 2003 Elsevier B.V. All rights reserved.