Efficient NC algorithms for set cover with applications to learning and geometry

Author:

Berger Bonnie,Rompel John,Shor Peter W.

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference29 articles.

1. Partitioning arrangements of lines I: An efficient deterministic algorithm;Agarwal;Discrete Computat. Geom.,1990

2. A fast and simple randomized parallel algorithm for the maximal independent set problem;Alon;J. Algorithms,1986

3. Set intersection problems;Anderson,1985

4. Parallel algorithms for arrangements;Anderson,1990

5. Compact distributed data structures for adaptive routing;Awerbuch,1989

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

1. Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph;Theoretical Computer Science;2022-10

2. BugDoc;The VLDB Journal;2022-02-23

3. Approaching Set Cover Leasing, Connected Dominating Set and Related Problems with Online Deterministic Algorithms;Operations Research and Enterprise Systems;2022

4. Parallel approximation for partial set cover;Applied Mathematics and Computation;2021-11

5. Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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