报告题目：Approximability status of Survivable Network Design Problems
报告人：黄小龙
时间：2016年5月11日15:30-17:00
地点：教2-501
主办单位：bat365在线官网入口, 复杂网络系统理论与应用研究中心
报告内容：Survivable Network Design Problem(SNDP) is an active research area in the intersection of Combinatorial Optimization and Theoretical Computer Science that focuses on problems arising in the realm of modern communication networks. In generality, the SNDP is hopeless: it is not only NP-hard to solve but also to approximate. During the last 30 years of research in this field a number of major techniques and results have emerged; In this talk we provide a survey of some of them.
报告人简介：黄小龙，男，博士，现为bat365在线官网入口教师。2013年毕业于南开大学组合数学中心，获得理学博士学位。主要研究方向为图论与组合最优化。目前主持bat365在线官网入口科研项目1项。近几年来，在Graphs and Combinatorics, Applied Mathematics and Computation, Discrete Math. Theoret. Comput. Sci., Bull. Malays. Math. Sci. Soc.等国内外期刊发表学术论文若干篇。