Title：Max 3 Cut with Limited Unbalance and Application  via Complex Semidefinite Programming

Abstract：The uses of linear programming for designing approximation algorithms for combinatorial optimization problems has long been known. Recently, researchers have investigated the use of nonlinear programming, particularly semidefinite programming motivated by the seminal paper of Lovasz, since semidefinite programs can be solved in polynomial time (up to any prescribed accuracy). In this talk, we mainly introduce our recent progress on the problem of Max-3-Cut with limited unbalance which has many applications via the randomized approximation technique based on complex semidefinite programming relaxation.

Speaker：Zhang Xiaoyan, Professor of Nanjing Normal University. His research interests include graph theory and Combinatorics. Many of his results published on《SIAM J. COMPUTING》、《SIAM J. SCIENTIFIC COMPUTING》、《SIAM J. DISCRETE MATH》and《J. GTAPH THEORY》.

Date：3:00pm-4:00pm 2021-8-20（Friday）.

Tencent Meeting ID： 496 941 443

Organizer：School of Mathematical Science

Students and teachers who are interested in graph theory are welcome.