应数学与统计学院徐守军教授邀请，南京师范大学数学科学学院及数学研究所张晓岩教授将于2018年06月18日至21日访问我校并作学术报告。
报 告1：Approximation Algorithm for Max Hypergraph Cut
时 间：06月19日下午16:00
地 点：齐云楼911 报告厅
摘要1：In this talk, we consider the design of randomized approximation algorithm for the Max Hypergraph Cut problem. 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 prgramming relaxation which can improve the previous performance ratios of some classical problems.
报 告2：Belief Propagation and Chinese Postman Problems
时 间：06月20日上午10:30
地 点：齐云楼911 报告厅
摘要2：Belief Propagation (BP), a distributed, message-passing algorithm in machine Learning, has been widely used in different disciplines including information theory, artificial intelligence, statistics and combinatorial optimization problems in graphical models such as Bayesian networks and Markov random fields. Despite BP has a great success in many application fields and many progress about BP has been made, the rigorous analysis about the correctness and convergence of BP are known in only a few cases for arbitrary graph. With the goal of identifying the broadest class of optimization problems solvable using the simple BP algorithm directly, we will investigate the correctness and convergence of BP for determining the optimal solutions of the Chinese Postman problems in both undirected and directed graphs.
欢迎广大师生参加！
报告人简介：
张晓岩, 2006年获得南开大学博士学位、2014年获得荷兰Twente大学博士学位，南京师范大学数学科学学院及数学研究所教授，博士生导师，南京师范大学“百名青年领军人才”、“青蓝工程”优秀中青年学术带头人，江苏省六大人才高峰高层次人才，江苏省运筹学监事会监事，中国运筹学图论与组合分会青年理事，荷兰在华学者协会会员，德国波恩大学离散数学研究所及英国伦敦大学皇家洛伦威学院访问教授。主要从事图上组合优化及理论计算机科学的研究工作，发表在《SIAM J. COMPUTING》、《SIAM J. SCIENTIFIC COMPUTING》、《SIAM J. DISCRETE MATH》及《J. GTAPH THEORY》等国际著名SCI学术期刊，主持多项国家自然科学基金及省部级课题并著有英文学术论著两部。
应用数学与复杂系统省级重点实验室
数学与统计学院
萃英学院
2018年06月15日