On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem

S. N. Astrakov, A. I. Erzin, and V. V. Zalyubovskii, “SensorMaps and Plane Covering with Rings,” Diskret. Anal. Issled. Oper. 16(3), 3–19 (2009).

T. F. Tot, Layouts on a Plane, on a Sphere, and in Space (Fizmatgiz, Moscow, 1958) [in Russian].

E. Althaus, et al. “Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks,” Wireless Networks 12(3), 287–299 (2006).

P. Berman and M. Karpinski, “On Some Tighter Inapproximability Results,” Electron. Colloquium Computational Complexity (ECCC), TR98–065 (1998).

A. E. F. Clementi, P. Penna, and R. Silvestri, “On the Power Assignment Problem in Radio Networks,” Electron. Colloquium Computational Complexity (ECCC), TR00–054 (2000).

P. Carmi and M. L. Katz, “Power Assignment in Radio Networks with Two Power Levels,” Algorithmica, No. 47, 183–201 (2007).

M. Diane and J. Plesnik, “An Integer Programming Formulation of the Steiner Problem in Graphs,” Math. Methods Oper. Res. 37, 107–111 (1993).

R. Kershner, “The Number of Circles Covering a Set,” Amer. J.Math. 61(3), 665–671 (1939).

L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, “Power Consumption in Packet Radio Networks,” Theor. Comput. Sci. No. 243, 289–305 (2000).

G. J. Pottie and W. J. Kaiser, “Wireless Integrated Network Sensors,” Commun. ACM 43(5), 51–58 (2000).

F. G. Tóth, “Covering the Plane with Two Kinds of Circles,” Discrete Comput. Geometry 13(3), 445–457 (1995).

J. Wu and F. Dai, ”Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges,” IEEE Trans. Mobile Comput. 5(9), 1188–1200 (2006).

J. Wu and S. Yang, “Energy-Efficient Node Scheduling Models in Sensor Networks with Adjustable Ranges,” Int. J. Found. Comput. Sci. 16(1), 3–17 (2005).

H. Zhang and J. C. Hou, “Maintaining Sensing Coverage and Connectivity in Large Sensor Networks,” Ad Hoc & Sensor Wireless Networks 1(1–2), 89–124 (2005).