Speaker：Prof. Zhao Zhang

          Zhejiang Normal University

Title: Approximation Algorithm for the Fault-Tolerant Connected Dominating Set Problem

Time：16:30, 21 Sept., 2020

Location：Conference Room 105 at Experiment Building at Haiyun Campus

Abstract:

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 analisis.