报告题目：Hardness Results on Steiner Type Packing Problems in Digraphs
（有向图中斯坦纳类型填装问题的复杂性结果）
报告人：孙跃方
时间：2021年12月17日（周五）上午10:00-12：00
地点：腾讯会议 184 018 751
主办单位:统计与数学学院、人工智能与深度学习研究所(“运筹、优化与控制”团队学术活动)
报告提纲:
Packing of combinatorial objects such as graphs, digraphs and hypergraphs by smaller objects are one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well-established area. In this talk, we will introduce the known hardness results on two Steiner type packing problems in digraphs: the directed Steiner tree packing problem and the strong subgraph packing problem.
报告人简介:
孙跃方，宁波大学数学与统计学院副教授、硕士生导师。2012年6月博士毕业于南开大学组合数学中心。曾赴伦敦大学皇家霍洛威学院访问1年。当前从事图论与组合优化方向，特别是有向图理论、算法与计算复杂性的研究。担任学术期刊《Theory and Applications of Graphs》Associate Editor。主持国家自然科学基金1项、浙江省自然科学基金1项。出版学术专著1部，发表学术论文50多篇。
初稿：郭影玲 复审：陈蔼祥 终稿：黄辉