Approximation algorithms for a geometric set cover problem-Reference-Cited by-同舟云学术

Approximation algorithms for a geometric set cover problem

Published:2012-05 Issue:7-8 Volume:160 Page:1039-1052
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Brimkov Valentin E.,Leach Andrew,Wu Jimmy,Mastroianni Michael

Funder

NSF

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference20 articles.

1. O. Aichholzer, R. Fabila-Monroy, D. Flores-Pealoza, T. Hackl, C. Huemer, J. Urrutia, B. Vogtenhuber, Modem illumination of monotone polygons, in: Proc. 25th European Workshop on Computational Geometry, EuroCG’09, Brussels, Belgium, 2009, pp. 167–170.

2. Hardness of set cover with intersection 1;Anil Kumar,2000

3. Worst-case-optimal algorithm for guarding planar graphs and polyhedral surfaces;Bose;Computational Geometry: Theory and Applications,2003

4. Experimental studies on approximation algorithms for guarding sets of line segments;Brimkov,2010

5. Guarding a set of line segments in the plane;Brimkov;Theoretical Computer Science,2011

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

1. Classical and Parameterized Complexity of Line Segment Covering Problems in Arrangement;Intelligent Data Engineering and Analytics;2023

2. Optimizing Number, Placement, and Backhaul Connectivity of Multi-UAV Networks;IEEE Internet of Things Journal;2022-11-01

3. Exploring Biological Robustness for Reliable Multi-UAV Networks;IEEE Transactions on Network and Service Management;2021-09

4. 3D Placement and Orientation of mmWave-Based UAVs for Guaranteed LoS Coverage;IEEE Wireless Communications Letters;2021-08

5. Intersections and circuits in sets of line segments;Journal of Combinatorial Optimization;2021-04-10