Approximating Maximum Matching Requires Almost Quadratic Time-Reference-Cited by-同舟云学术

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

Approximating Maximum Matching Requires Almost Quadratic Time

Published:2024-06-10 Issue: Volume: Page:444-454
ISSN:
Container-title:Proceedings of the 56th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Behnezhad Soheil¹^ORCID,Roghani Mohammad²^ORCID,Rubinstein Aviad²^ORCID

Affiliation:

1. Northeastern University, Boston, USA

2. Stanford University, Stanford, USA

Funder

David and Lucile Packard Fellowship

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3618260.3649785

Reference24 articles.

1. Amir Azarmehr Soheil Behnezhad and Mohammad Roghani. [n. d.]. Fully Dynamic Matching: (2-√ 2)-Approximation in Polylog Update Time. 3040–3061. https://doi.org/10.1137/1.9781611977912.109 10.1137/1.9781611977912.109

2. Time-Optimal Sublinear Algorithms for Matching and Vertex Cover

3. Dynamic Algorithms for Maximum Matching Size

4. Local Computation Algorithms for Maximum Matching: New Lower Bounds

5. Sublinear Time Algorithms and Complexity of Approximate Maximum Matching

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP