09-30【张晓岩】管楼1418 吴文俊数学重点实验室组合图论系列讲座之144

时间:2019-09-29

报告题目:Approximate Graph and Hypergraph Partitions via SemidefiniteProgramming 

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

时间:9月30号 下午3:00-4:00 

地点:1418 

摘要:

Partitioning large graph and hypergraph is often an important subproblem for complexity reduction or parallelization computing in mathematics and computer science. In general, most partitioning problems are NP-hard  and

even hard to approximate. With the advent of ever instances in various applications, such as VLSI cuicuit design and image processing,

approximating graph and hypergraph partition problems become more and more important and challenging. In the talk, we will introduce our recent results on approximating graph and hypergraph partitioning problems with

applications via (complex) semidefinite programming techinques. 

张晓岩, 南京师范大学澳门新葡新京及数学研究所教授,博士生导师,南京师范大学“百名青年领军人才”、“青蓝工程”优秀中青年学术带头人,江苏省六大人才高峰高层次人才,江苏省运筹学监事会监事,中国运筹学数学规划分会理事,中国运筹学图论与组合分会理事,荷兰在华学者协会会员,德国波恩大学离散数学研究所及英国伦敦大学皇家洛伦威澳门新葡新京官方网站访问教授。主要从事图上组合优化、芯片设计图算法及理论计算机科学的研究工作,研究成果发表在《SIAM J. COMPUTING》、《SIAM J. SCIENTIFIC COMPUTING》、《SIAM J. DISCRETE MATH》及《J. GTAPH THEORY》等国际著名SCI学术期刊,主持多项国家自然科学基金及省部级课题并著有英文学术论著两部。

XML 地图 | Sitemap 地图