Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference25 articles.
1. Ambühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-factor approximation for minimum weight (connected) dominating sets in unit disk graphs. In: APPROX-RANDOM, pp. 3–14 (2006)
2. Belgi, A., Nutov, Z.: An $$\tilde{O} (\log ^2 n)$$-approximation algorithm for 2-edge-connected dominating set. Inf. Process. Lett. (2021) (to appear)
3. Cheng, X., Huang, X., Li, D., Weili, W., Du, D.Z.: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42(4), 202–208 (2003)
4. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1–3), 165–177 (1990)
5. Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: IEEE International Conference on Communications, pp. 376-380 (1997)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献