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

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares

  • Published:2016-01 Issue: Volume:51 Page:25-39
  • ISSN:0925-7721
  • Container-title:Computational Geometry
  • language:en
  • Short-container-title:Computational Geometry

Author:

Ito Takehiro,Nakano Shin-ichi,Okamoto Yoshio,Otachi Yota,Uehara Ryuhei,Uno Takeaki,Uno Yushi

Funder

Grant-in-Aid for Scientific Research

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference21 articles.

1. Approximation algorithms for NP-complete problems on planar graphs;Baker;J. ACM,1994

2. Schémas d'approximation et complexité paramétrée;Bazgan,1995

3. On the efficiency of polynomial time approximation schemes;Cesati;Inf. Process. Lett.,1997

4. Geometric red–blue set cover for unit squares and related problems;Chan;Comput. Geom. Theory Appl.,2015

5. Approximate algorithms for some generalized knapsack problems;Chandra;Theor. Comput. Sci.,1976

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

1. Improved Algorithms for Minimum-Membership Geometric Set Cover;Lecture Notes in Computer Science;2024

2. Exact Multi-Covering Problems with Geometric Sets;Theory of Computing Systems;2021-07-21

3. Minimum Membership Covering and Hitting;Theoretical Computer Science;2021-07

4. Minimum ply covering of points with disks and squares;Computational Geometry;2021-03

5. Maximum independent and disjoint coverage;Journal of Combinatorial Optimization;2020-02-14
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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