IEEE Gainesville Section Presents 

Connected Dominating Set in Ad Hoc Wireless Networks

Professor Ding-Zhu Du
Department of Computer Science and Engineering
University of Minnesota

Place: 102 Engineering Building
Time:  1:50-2:50pm, Tuesday, February 17 

Abstract

Connected Dominating Set plays an important role in ad hoc 
wireless networks. There are many constructions of 
approximation solution for minimum connected dominating set 
in ad hoc wireless networks existing in the literature. 
We overview them and propose some new constructions with 
better performance in each case.   


Brief Biography 

Dr. Ding-Zhu Du is a professor in Department of Computer Science and 
Engineering, University of Minnesota. He received his Ph.D. from 
University of California at Santa Barbara in 1985 and his M.S. from 
Chinese Academy of Sciences in 1982. Before settled in Minnesota, He 
worked in Mathematical Sciences Research Institute at Berkeley, MIT, 
Chinese Academy of Sciences, and Princeton University for totally six 
years. He received public recognition and awards when he solved two 
long-standing open problems on the Euclidean minimum Steiner trees, 
the proof of Gilbert-Pollak's conjecture on the Steiner ratio, and 
the existence of a polynomial-time heuristic with a performance ratio 
bigger than the Steiner ratio.

Dr. Du has published more than 140 journal papers and several books. He 
is the editor-in-chief for Journal of Combinatorial Optimization and 
also in editorial board for several other journals. There are 25 Ph.D.s 
graduated under his supervision and 15 of them are university professors 
now. His current research interests include design  and analysis of 
approximation algorithms for combinatorial optimization problems with 
various applications in computer networking, telecommunication, VLSI 
designs, etc, especially in wireless networking and mobile computing.