Covering Users by a Connected Swarm Efficiently
暂无分享,去创建一个
[1] Dimitrios Zorbas,et al. Modelling the mobile target covering problem using flying drones , 2016, Optim. Lett..
[2] Haitao Zhao,et al. Deployment Algorithms for UAV Airborne Networks Toward On-Demand Coverage , 2018, IEEE Journal on Selected Areas in Communications.
[3] Rui Zhang,et al. Wireless communications with unmanned aerial vehicles: opportunities and challenges , 2016, IEEE Communications Magazine.
[4] Joseph S. B. Mitchell,et al. Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint , 2019, APPROX-RANDOM.
[5] Walid Saad,et al. Efficient Deployment of Multiple Unmanned Aerial Vehicles for Optimal Wireless Coverage , 2016, IEEE Communications Letters.
[6] Samir Khuller,et al. Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems , 2013, SODA.
[7] Mark de Berg,et al. Covering Many or Few Points with Unit Disks , 2006, Theory of Computing Systems.
[8] Eytan Modiano,et al. Construction and Maintenance of Wireless Mobile Backbone Networks , 2009, IEEE/ACM Transactions on Networking.
[9] Naveen Garg,et al. Saving an epsilon: a 2-approximation for the k-MST problem in graphs , 2005, STOC '05.
[10] Haitao Wang,et al. Linear Time Approximation Schemes for Geometric Maximum Coverage , 2015, COCOON.
[11] Dimitrios Zorbas,et al. Optimal drone placement and cost-efficient target coverage , 2016, J. Netw. Comput. Appl..
[12] Michael Segal,et al. Connected Ad-Hoc swarm of drones , 2020, DroNet@MobiSys.
[13] Mohammadreza Razzazi,et al. The Most Points Connected-Covering Problem with Two Disks , 2018, Theory of Computing Systems.
[14] Kate Ching-Ju Lin,et al. Maximizing Submodular Set Function With Connectivity Constraint: Theory and Application to Networks , 2015, IEEE/ACM Trans. Netw..
[15] David S. Johnson,et al. The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.
[16] Rui Zhang,et al. Placement Optimization of UAV-Mounted Mobile Base Stations , 2016, IEEE Communications Letters.