Time-Optimal Sublinear Algorithms for Matching and Vertex Cover-Reference-Cited by-同舟云学术

Time-Optimal Sublinear Algorithms for Matching and Vertex Cover

Published:2022-02 Issue: Volume: Page:
ISSN:
Container-title:2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Behnezhad Soheil¹

Affiliation:

1. Stanford University

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9719594/9719683/09719699.pdf?arnumber=9719699

Reference27 articles.

1. Sublinear Algorithms and Lower Bounds for Metric TSP Cost Es-timation;chen;47th International Colloquium on Automata Languages and Programming ICALP 2020 July 8–11 2020 Saarbrücken Germany (Virtual Conference),0

2. Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time

3. Sublinear-time Algorithms

4. Sublinear Time Approxi-mation of the Cost of a Metric k- Nearest Neighbor Graph;czumaj;In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms SODA 2020,2020

5. Metric Sub-linear Algorithms via Linear Sampling;esfandiari;59th IEEE Annual Symposium on Foundations of Computer Science FOCS 2018 Paris France October 7–9 2018,2018

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

1. O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Approximating Maximum Matching Requires Almost Quadratic Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Approximate Earth Mover’s Distance in Truly-Subquadratic Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. Interactive Activities Initiation through Retrieving Hidden Social Information Networks;2023 IEEE International Conference on Data Mining (ICDM);2023-12-01

5. Local Computation Algorithms for Maximum Matching: New Lower Bounds;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06