Speaker

Prof. Dingzhu DU, Department of Computing Science，University of Texas at Dallas, USA  

　　Title

Max lifetime k-coverage problem

　　Time

　　Venue

N204

　　Abstract

Coverage/k-coverage is a well-known classic optimization problem in wireless sensor networks. This talk shows you a recent development that for any positive integer k, max lifetime k-coverage problem has a polynomial-time 3-approximation.  

　　Affiliation

Dingzhu Du received his MS degree in operations research from Institute of Applied Mathematics, CAS in 1982, and PhD degree in mathematics from University of California at Santa Barbara in 1985. He is the founding editor-in-chief of Journal of Combinatorial Optimization, Discrete Mathematics, Algorithms and Applications, Computational Social Networks. He received CSTS Prize from INFORMS in 1998 for his research excellence in the interface between operations research and computer science. He received the 2nd Prize of National Nature Science of China in 1996 and the Award of National Young Scientist of China in 1992.