Covering a line segment with variable radius discs

Computers and Operations Research

Volumn 36, Issue 5, 2009, Pages 1423-1436

  Agnetis, Alessandro ^a   Grande, Enrico ^b   Mirchandani, Pitu B ^b   Pacifici, Andrea ^c  

^a UNIVERSITY OF SIENA   (Italy)

^b UNIVERSITY OF ARIZONA   (United States)

^c UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Mixed integer nonlinear programming; Network covering problems; Sensor location

Indexed keywords

COST ACCOUNTING; HEURISTIC ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; LOCATION; SENSOR NETWORKS; SENSORS;

BRANCH-AND-BOUND ALGORITHMS; CIRCULAR FIELD OF VIEWS; CONVEX FUNCTIONS; COVERING PROBLEMS; DISC COVERING PROBLEMS; EFFICIENT EXACT ALGORITHMS; LINE SEGMENTS; MIXED INTEGER NONLINEAR PROGRAMMING; NETWORK COVERING PROBLEMS; OF SENSORS; OPTIMAL SOLUTIONS; PAPER ADDRESSES; POLYNOMIAL ALGORITHMS; SENSOR LOCATION; VARIABLE COSTS; VARIABLE RADIUSES;

PROBLEM SOLVING;

EID: 55749106378     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.02.013     Document Type: Article

References (22)

1. Pacifici A, Mirchandani P, Mecoli M, Agnetis A. Locational decisions for barge-tracking radars, Technical Report, The A.T.L.A.S. research center, 2004.
2. Ghosh A., and Rushton G. Spatial analysis and allocation-location modeling (1987), Van Nostrand Reinhold Company, New York
3. Kolen A., and Tamir A. Discrete location theory: covering problems (1990), Wiley, New York p. 263-304 [chapter 6]
4. Love R.F., Morris J.G., and Wesolowsky G.O. Facility location: models and methods (1988), North-Holland Publishing Company, New York
5. Mirchandani P.B., and Francis R.L. Discrete location theory (1990), Wiley, New York
6. Chvátal V. A combinatorial theorem in plane geometry. Journal of Combinatorial Theory 18 (1975) 39-41
7. Hoffmann F, Kaufmann M, Kriegel K. The art gallery theorem for polygons with holes. In: 32nd Annual symposium on foundations of computer science, San Juan, Puerto Rico, October 1991, p. 39-48.
8. O'Rourke J. Art gallery theorems and algorithms (1987), Oxford University Press, Oxford
9. Hochbaum D.S., and Maas W. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM 32 1 (1985) 130-136
10. Brönnimann H., and Goodrich M.T. Almost optimal set covers in finite VC-dimension. Discrete Computational Geometry 14 (1995) 463-479
11. Franceschetti M, Cook M, Bruck J. A geometric theorem for approximate disk covering algorithms. Technical report, California Institute of Technology, 2001.
12. Xiao B, Zhuge Q, Zhang Y, Sha EH-M, Algorithms for disk covering problems with the most points. In: Proceedings of the IASTED international conference on parallel and distributed computing and systems (IASTED PDCS), Marina del Ray, CA, November 2003, p. 541-6.
13. Huang C.-F., and Tseng Y.-C. A survey of solutions to the coverage problems in wireless sensor networks. Journal of Internet Technology 6 (2005) 1-8
14. Wang B. A survey on coverage problems in wireless sensor networks. Technical report, ECE Department, National University of Singapore, 2006.
15. Alt H., Arkin E.M., Brönnimann H., Erickson J., Fekete S.P., Knauer C., Lenchner J., Mitchell J.S.B., and Whittlesey K. Minimum-cost coverage of point sets by disks. Proceedings of the 22nd annual ACM symposium on computational geometry (June 5-7, 2006) 449-458
16. Galota M., Glaßer C., Reith S., and Vollmer H. A polynomial-time approximation scheme for base station positioning in UMTS networks. Proceedings of the 5th international workshop on discrete algorithms and methods for mobile computing and communications (2001) 52-59
17. Franceschetti M., Cook M., and Bruck J. A geometric theorem for network design. IEEE Transactions on Computers 53 (2004) 483-489
18. Meguerdichian S, Koushanfar F, Potkonjak M, Srivastava MB. Coverage problems in wireless ad-hoc sensor networks. In: INFOCOM 2001. 20th annual joint conference of the IEEE computer and communications societies, vol. 3, Anchorage, AK, USA, 2001. p. 1380-7.
19. Li X.-Y., Wan P.-J., and Frieder O. Coverage in wireless ad hoc sensor networks. IEEE Transactions on Computers 52 (2003) 753-763
20. Hamacher H., Liebers A., Schöbel A., Wagner D., and Wagner F. Locating new stops in a railway network. Electronic Notes in Theoretical Computer Science 50 (2001) 11
21. Mammana M.F., Mecke S., and Wagner D. The station location problem on two intersecting lines. Electronic Notes in Theoretical Computer Science 92 1 (2003) 12
22. Grande E. Localizzazione di radar per il monitoraggio di bacini fluviali (english translation: Radar locations for river monitoring). Master's thesis, University of Rome "Tor Vergata", Italy, 2005.