Data Communication and Data Management Laboratory @ University of Texas at Dallas

---

/home/seminar3/Spring2008

Seminar Series

by Xiaofeng Gao

1. New Approximation Algorithm to Select Minimum Weighted Dominating Set in Unit Disk Graph

• Date: January 18, 2008
• References: Yaochun Huang, Xiaofeng Gao, Zhao Zhang, Weili Wu, Constant-factor Approximation for Weighted Dominating Set in Unit Disk Graph, to appera in Journal of Combinatorial Optimization.
  

2. Minimum Weighted Connected Dominating Set in Unit Disk Graph

• Date: February 1, 2008
• References: Xiaofeng Gao, Yaochun Huang, Zhao Zhang, Weili Wu, (6+\varepsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs, The 14th Annual International Computing and Combinatorics Conference (COCOON 2008), Dalian, China, June 27-29, 2008.

3. The Canadian Traveller Problem and Its Competitive Analysis

• Date: February 15, 2008
• References: Stephan Westphal, A Note on the k-Canadian Traveller Problem, Information Processing Letters, 2007.

4. Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph

• Date: March 21, 2008
• References: Zhao Zhang, Xiaofeng Gao, Weili Wu, Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph, The 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA'08), August 21-24, 2008, in St. John's, Canada.
  

---