报告题目：Approximation Algorithm for Max Hypergraph Cut with Capacity

报告简介：In this talk, we consider the design of randomized approximation algorithm for the Max Hypergraph Cut problem with capacity. This kind of problem generalizes some classical graph partition problems including Max Cut, Max Hypergraph Cut and Max Hypergraph Bisection, etc. We introduce a randomized approximation algorithm based on semidefinite programming relaxation which can improve the previous performance ratios of some classical problems.

报告人：张晓岩教授，南京师范大学

报告时间：2019年06月05日（星期三）下午 4:20

报告地点：扬州大学瘦西湖校区数学科学学院38号楼103报告厅

主办单位：扬州大学数学科学学院

欢迎广大师生参加！