Radar placement along banks of river

Journal of Global Optimization

Volumn 52, Issue 4, 2012, Pages 729-741

  Zhang, Zhao ^a   Du, Ding Zhu ^b  

^a XINJIANG UNIVERSITY   (China)

^b The University of Texas at Dallas   (United States)

Author keywords

Coverage; Power assignment; Radar placement

Indexed keywords

COVERAGE; DYNAMIC PROGRAMMING ALGORITHM; K-COVERAGE; POWER ASSIGNMENT; TOTAL POWER;

APPROXIMATION ALGORITHMS; DYNAMIC PROGRAMMING; RIVERS;

RADAR;

EID: 84875626556     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-011-9704-3     Document Type: Article

References (15)

1. Agnetis A.; Grande E.; Mirchandani P.B.; Pacifici A.: Covering a line segment with variable radius discs. Comput. Oper. Res. 36, 1423-1436 (2009)
2. Alt, H.; Arkin, E.M.; Brönnimann, H.; Erickson, J.; Fekete, S.P.; Knauer, C.; Lenchner, J.; Mitchell, J.S.B.; Whittlesey, K.: Minimum-cost coverage of point sets by disks. In: Proceedings of the 22nd Annual ACM Symposium on Computational Geometry, pp. 449-458 (2006)
3. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. In: Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (1983), pp. 254-273. J. ACM 41, 153-180 (1994)
4. Bilò, V.; Caragiannis, I.; Kaklamanis, C.; Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: Proceedings of the 13th Annual European Symposium on Algorithms, LNCS, vol. 3669, pp. 60-71 (2005)
5. Cardei I.; Cardei M.; Wang L.S.; Xu B.G.; Du D.-Z.: Optimal relay location for resource-limited energy-efficient wireless communication. J. Glob. Optim. 36, 391-399 (2006)
6. Cheng, M.X.; Gong, X.: Maximum lifetime coverage preserving scheduling algorithms in sensor networks. J. Glob. Optim. doi: 10.1007/s10898-010-9636-3
7. Chvátal V.: A combinatorial theorem in plane geometry. J. Comb. Theory 18, 39-41 (1975)
8. Glaßer C.; Reith S.; Vollmer H.: The complexity of base station positioning in cellular networks. Discrete Appl. Math. 148, 1-12 (2005)
9. Gupta H.; Zhou Z.; Das R.; Gu Q.: Connected sensor cover: self-organizaiton of sensor networks for efficient query execution. IEEE/ACM Trans. Netw. 16, 55-67 (2006)
10. Hochbaum D.S.; Mass W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130-136 (1985)
11. Hoffmann, F.; Kaufmann, M.; Kriegel, K.: The art gallery theorem for polygons with holes. In: IEEE 32nd Annual Symposium of Foundations of Computer Science, pp. 39-48 (1991)
12. Huang, C.F.; Tseng, Y.C.: The coverage problem in a wireless sensor network. In: ACM International Workshop on Wireless Sensor Networks and Applications, pp. 115-121 (2003)
13. Lev-Tov N.; Peleg D.: Polynomial time approximation shcemes for base station coverage with minimum total radii. Comput. Netw. 47, 489-501 (2005)
14. Pardalos, P.M.; Resende, M. (eds): Handbook of Applied Optimization. Oxford University Press, Oxford (2002)
15. Wang, X.; Xing, G.; Zhang, Y.; Lu, C.; Pless, R.; Gill, C.: Integrated coverage and connectivity configuration in wireless sensor networks. In: ACM International Conference on Embedded Networked Sensor Systems, pp. 28-39 (2003)