Approximation Algorithm for the Fault-Tolerant Connected Dominating Set Problem
报告题目(Title)：Approximation Algorithm for the Fault-Tolerant Connected Dominating Set Problem
报告人(Speaker)：张昭 教授（浙江师范大学）
地点(Place)：腾讯会议 ID：746 166 009
时间(Time)：2020.12.22（星期二） 16：30-17：30
邀请人(Inviter)：徐敏 吕本建
报告摘要
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 design and analysis.
