Browsing Combinatorics and Optimization by Subject "Semidefinite Programmming"
Now showing items 1-1 of 1
-
ADMM for SDP Relaxation of GP
(University of Waterloo, 2016-08-30)We consider the problem of partitioning the set of nodes of a graph G into k sets of given sizes in order to minimize the cut obtained after removing the k-th set. This is a variant of the well-known vertex separator ...