The NP-completeness column: An ongoing guide-Reference-Cited by-同舟云学术

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

The NP-completeness column: An ongoing guide

Published:1982-06 Issue:2 Volume:3 Page:182-195
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Johnson David S

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference43 articles.

1. Calculating bounds on certain measures of network reliability;Ball,1981

2. On the inherent intractability of certain coding problems;Berlekamp;IEEE Trans. Inform. Theory,1978

3. Optimal tile salvage;Berman,1982

4. Dominating sets in chordal graphs;Booth;SIAM J. Comput.,1982

5. S. Burr, private communication, 1982.

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

1. Covering Polygons is Even Harder;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

2. The Covering-Assignment Problem for Swarm-Powered Ad Hoc Clouds: A Distributed 3-D Mapping Usecase;IEEE Internet of Things Journal;2021-05-01

3. Covering polygons with discs: The problem of crane selection and location on construction sites;Omega;2020-12

4. Energy-Efficient Resource Allocation in Data Centers Using a Hybrid Evolutionary Algorithm;Machine Learning for Intelligent Decision Science;2020

5. On Geometric Set Cover for Orthants;LEIBNIZ INT PR INFOR;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP