Coverage with k-transmitters in the presence of obstacles-Reference-Cited by-同舟云学术

Coverage with k-transmitters in the presence of obstacles

Published:2012-03-15 Issue:2 Volume:25 Page:208-233
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Ballinger Brad,Benbernou Nadia,Bose Prosenjit,Damian Mirela,Demaine Erik D.,Dujmović Vida,Flatland Robin,Hurtado Ferran,Iacono John,Lubiw Anna,Morin Pat,Sacristán Vera,Souvaine Diane,Uehara Ryuhei

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-012-9475-x.pdf

Reference20 articles.

1. Aichholzer O, Aurenhammer F, Hurtado F, Ramos P, Urrutia J (2009a) k-convex polygons. In: Proc 25th European conference on computational geometry, pp 117–120

2. Aichholzer O, Fabila-Monroy R, Flores-Peñaloza D, Hackl T, Huemer C, Urrutia J, Vogtenhuber B (2009b) Modem illumination of monotone polygons. In: Proc 25th European conference on computational geometry, pp 167–170

3. Contemporary mathematics;K Appel,1989

4. Borodin O (1984) Solution of Ringel’s problem on vertex-face coloring of plane graphs and coloring of 1-planar graphs (in Russian). Metody Diskret Analiz 41:12–26

5. Borodin O (1995) A new proof of the 6 color theorem. J Graph Theory 19(4):507–521

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Discrete Planar Two-Watchtower Problem for k-Visibility;The 6th International Conference on Wireless, Intelligent and Distributed Environment for Communication;2023-10-14

2. Lower Bound for Sculpture Garden Problem: Localization of IoT Devices;Applied Sciences;2023-02-17

3. Computing the k-Visibility Region of a Point in a Polygon;Theory of Computing Systems;2020-08-11

4. Covering orthogonal polygons with sliding k-transmitters;Theoretical Computer Science;2020-05

5. A time–space trade-off for computing the k-visibility region of a point in a polygon;Theoretical Computer Science;2019-10