论文信息 - Strongly Connected Dominating Set - 字舞流文

Strongly Connected Dominating Set

[1] Ding-Zhu Du,et al. Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links , 2006, APWeb.

[2] Deying Li,et al. Construction of strongly connected dominating sets in asymmetric multihop wireless networks , 2009, Theor. Comput. Sci..

[3] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .

[4] S. Guha,et al. Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[5] Matt Gibson,et al. Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier - (Extended Abstract) , 2010, ESA.

[6] Nabil H. Mustafa,et al. PTAS for geometric hitting set problems via local search , 2009, SCG '09.

[7] Samir Khuller,et al. Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets , 1998, Inf. Comput..

[8] Chen Wang,et al. A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges , 2007, MobiHoc '07.

[9] R. Ravi,et al. A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[10] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..

[11] Greg N. Frederickson,et al. Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[12] Xiang-Yang Li,et al. Efficient Construction of Dominating Set in Wireless Networks , 2012, ArXiv.