Exact Multi-Covering Problems with Geometric Sets-Reference-Cited by-同舟云学术

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

Exact Multi-Covering Problems with Geometric Sets

Published:2021-07-21 Issue:1 Volume:66 Page:89-113
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Ashok Pradeesha,Kolay Sudeshna,Misra Neeldhara,Saurabh Saket

Funder

Department of Science and Technology, Ministry of Science and Technology

European Research Council

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00224-021-10050-z.pdf

Reference26 articles.

1. Ashok, P., Kolay, S., Misra, N., Saurabh, S.: Unique covering problems with geometric sets International Computing and Combinatorics Conference, pp. 548–558. Springer (2015)

2. Ashok, P., Roy, A.B., Govindarajan, S.: Local search strikes again: Ptas for variants of geometric covering and packing. J. Comb. Optim. 39(2), 618–635 (2020)

3. Bansal, N., Pruhs, K.: Weighted geometric set multi-cover via quasi-uniform sampling. In: European Symposium on Algorithms, pages 145–156. Springer (2012)

4. Chekuri, C., Clarkson, K.L., Har-Peled, S.: On the set multicover problem in geometric settings. ACM Trans. Algorithms (TALG) 9(1), 1–17 (2012)

5. Demaine, E.D., Feige, U., Hajiaghayi, M.-T., Salavatipour, M.R.: Combination can be hard: Approximability of the unique coverage problem. SIAM J. Comput. 38(4), 1464–1483 (2008)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP