时间：2008年5月15日－16日，上午8：30－11：30，下午2：30－5：30
地点：理科楼407室
主题：
(1) Packing, Dominating and Wireless Networking
(2) High Dimensional Partition: PTAS for connected dominating set in 3-dimensinal wireless sensor networks
(3)Double Partition: (6+\varepsilon)-approximation for minimum weight dominating set in unit disk graph
(4) Analysis of Greedy Approximation with Nonpotential Functions:minimum connected dominating set in graphs and hypergraphs
(5) Spider Decomposition: the minimum strongly-connected dominating set in directed graphs