Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond-Reference-Cited by-同舟云学术

Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Abboud Amir¹,Bringmann Karl²,Khoury Seri³,Zamir Or⁴

Affiliation:

1. Weizmann Institute of Science, Israel

2. Saarland University, Germany / MPI-INF, Germany

3. University of California at Berkeley, USA

4. Institute for Advanced Study at Princeton, USA

Publisher

ACM

Link

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

Reference93 articles.

1. Dynamic set cover: improved algorithms and lower bounds

2. Amir Abboud and Arturs Backurs . 2017 . Towards hardness of approximation for polynomial time problems . In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Amir Abboud and Arturs Backurs. 2017. Towards hardness of approximation for polynomial time problems. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017).

3. The 4/3 Additive Spanner Exponent Is Tight

4. A Hierarchy of Lower Bounds for Sublinear Additive Spanners

5. Fooling views: a new lower bound technique for distributed computations under congestion

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

1. A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Maximum Bipartite Matching in ²⁺⁽¹⁾ Time via a Combinatorial Algorithm;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. Deterministic Fully Dynamic SSSP and More;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

5. Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02