Date: October, 2nd, Tuesday
Time: 11:45 am
Place: Little 339 (the Atrium)
Speaker: Dung T. Phan


Drinks and Pizza will be provided after the talk

Title:  Graph partitioning and continuous quadratic programming

Abstract:

 We are concerned about a continuous quadratic
programming formulation for min-cut graph partitioning problems
where we partition the vertices of a graph into disjoint sets
satisfying specified size constraints, while minimizing the sum of
the weights of edges connecting vertices in different sets.
Necessary and sufficient conditions characterizing local minima of
the quadratic program are given. This talk is based on joint work
with Dr Hager.
กก