Author:
Danilchenko Kiril,Segal Michael,Nutov Zeev
Publisher
Springer International Publishing
Reference18 articles.
1. Danilchenko, K., Segal, M.: Connected ad-hoc swarm of drones. In: Proceedings of the 6th ACM Workshop on Micro Aerial Vehicle Networks, Systems, and Applications, DroNet 2020, New York, NY, USA. Association for Computing Machinery (2020). https://doi.org/10.1145/3396864.3399699
2. De Berg, M., Cabello, S., Har-Peled, S.: Covering many or few points with unit disks. Theory Comput. Syst. 45(3), 446–469 (2009)
3. Garg, N.: Saving an epsilon: a 2-approximation for the $$k$$-MST problem in graphs. In: STOC, pp. 396–402 (2005)
4. Huang, C.-C., Mari, M., Mathieu, C., Mitchell, J.S.B., Mustafa, N.H.: Maximizing covered area in the Euclidean plane with connectivity constraint. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)
5. Jin, K., Li, J., Wang, H., Zhang, B., Zhang, N.: Near-linear time approximation schemes for geometric maximum coverage. Theoret. Comput. Sci. 725, 64–78 (2018)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献