Now showing items 1-2 of 2

    • ADMM for SDP Relaxation of GP 

      Sun, Hao (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 ...
    • Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems 

      Wang, Ningchuan (University of Waterloo, 2014-09-03)
      The Graph Partitioning problems are hard combinatorial optimization problems. We are interested in both lower bounds and upper bounds. We introduce several methods including basic eigenvalue and projected eigenvalue ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages