Near-Linear Algorithms for Geometric Hitting Sets and Set Covers-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Near-Linear Algorithms for Geometric Hitting Sets and Set Covers

Published:2019-05-09 Issue:2 Volume:63 Page:460-482
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Agarwal Pankaj K.,Pan Jiangwei^ORCID

Funder

National Science Foundation

Army Research Office

United States - Israel Binational Science Foundation

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00454-019-00099-6.pdf

Reference44 articles.

1. Afshani, P., Chan, T.M.: Optimal halfspace range reporting in three dimensions. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’09), pp. 180–186. SIAM, Philadelphia (2009)

2. Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 223, pp. 1–56. American Mathematical Society, Providence (1999)

3. Agarwal, P.K., Ezra, E., Sharir, M.: Near-linear approximation algorithms for geometric hitting sets. Algorithmica 63(1–2), 1–25 (2012)

4. Alon, N.: A non-linear lower bound for planar epsilon-nets. Discrete Comput. Geom. 47(2), 235–244 (2012)

5. Aronov, B., de Berg, M., Ezra, E., Sharir, M.: Improved bounds for the union of locally fat objects in the plane. SIAM J. Comput. 43(2), 543–572 (2014)

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

1. On the line-separable unit-disk coverage and related problems;Computational Geometry;2024-12

2. Online Geometric Covering and Piercing;Algorithmica;2024-06-03

3. Online hitting of unit balls and hypercubes in Rd using points from Zd;Theoretical Computer Science;2024-04

4. A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces;Operations Research Letters;2023-09

5. Worbel: Aggregating Point Labels into Word Clouds;ACM Transactions on Spatial Algorithms and Systems;2023-08-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3