数学系 Seminar 第2031 期
数学系“60周年”系庆系列报告
报告主题：Approximation Algorithm for the Fault-Tolerant Connected Dominating Set
报告人：张昭 教授 （浙江师范大学）
报告时间：2020年10月23日（周五） 17:00-18:00
参会方式：腾讯 会议
会议ID：938 973 7719
主办部门：理学院数学系
报告摘要：Approximation algorithm deals with NP-hard problems by providing theoretically guaranteed accuracy analysis. In this talk, I'll present some of our approximation algorithms for the construction of fault-tolerant virtual backbone of a wireless sensor network, which can be modeled as a (k,m)-connected dominating set in a graph. The focus will be put on the methods and developing ideas for the designing and analyzing.
欢迎教师、学生参加！
