Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover-Reference-Cited by-同舟云学术

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

Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover

Published:2023-10-06 Issue:5 Volume:52 Page:1132-1192
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Bhattacharya Sayan¹,Henzinger Monika²^ORCID,Nanongkai Danupon³^ORCID,Wu Xiaowei⁴^ORCID

Affiliation:

1. University of Warwick, Coventry CV4 7AL, UK.

2. Institute of Science and Technology Austria (ISTA), Vienna 1090, Austria.

3. Max Planck Institute for Informatics, 66123 Saarbrücken, Germany; Saarland University, 66123 Saarbrücken, Germany; and KTH, 114 28 Stockholm, Sweden.

4. University of Macau, Taipa, Macau, China.

Funder

FP7 Ideas: European Research Council

H2020 European Research Council

Guangdong Science and Technology Department

Shanghai Science and Technology Development Foundation

Svenska Forskningsrådet Formas

Engineering and Physical Sciences Research Council

Universidade de Macau

Vienna Science and Technology Fund

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Reference8 articles.

1. Dynamic algorithms via the primal-dual method

2. A Greedy Heuristic for the Set-Covering Problem

3. A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

4. Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization

5. Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP