Cited By
View all- Van Den Brand JKarczmarz A(2023)Deterministic Fully Dynamic SSSP and More2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00142(2312-2321)Online publication date: 6-Nov-2023
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics
Pages 391 - 404
Abstract
The “short cycle removal” technique was recently introduced by Abboud, Bringmann, Khoury and Zamir (STOC ’22) to prove fine-grained hardness of approximation. Its main technical result is that listing all triangles in an n1/2-regular graph is n2−o(1)-hard even when the number of short cycles is small; namely, when the number of k-cycles is O(nk/2+γ) for γ<1/2. Its corollaries are based on the 3-SUM conjecture and their strength depends on γ, i.e. on how effectively the short cycles are removed.
Abboud et al. achieve γ≥ 1/4 by applying structure versus randomness arguments on graphs. In this paper, we take a step back and apply conceptually similar arguments on the numbers of the 3-SUM problem, from which the hardness of triangle listing is derived. Consequently, we achieve the best possible γ=0 and the following lower bound corollaries under the 3-SUM conjecture:
* Approximate distance oracles: The seminal Thorup-Zwick distance oracles achieve stretch 2k± O(1) after preprocessing a graph in O(m n1/k) time. For the same stretch, and assuming the query time is no(1) Abboud et al. proved an Ω(m1+1/12.7552 · k) lower bound on the preprocessing time; we improve it to Ω(m1+1/2k) which is only a factor 2 away from the upper bound. Additionally, we obtain tight bounds for stretch 2+o(1) and 3−є and higher lower bounds for dynamic shortest paths.
* Listing 4-cycles: Abboud et al. proved the first super-linear lower bound for listing all 4-cycles in a graph, ruling out (m1.1927+t)1+o(1) time algorithms where t is the number of 4-cycles. We settle the complexity of this basic problem by showing that the O(min(m4/3,n2) +t) upper bound is tight up to no(1) factors.
Our results exploit a rich tool set from additive combinatorics, most notably the Balog-Szemerédi-Gowers theorem and Rusza’s covering lemma. A key ingredient that may be of independent interest is a truly subquadratic algorithm for 3-SUM if one of the sets has small doubling.
References
[1]
Amir Abboud, Karl Bringmann, Seri Khoury, and Or Zamir. 2022. Hardness of approximation in P via short cycle removal: Cycle detection, distance oracles, and beyond. In 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2022). ACM, 1487–1500. https://doi.org/10.1145/3519935.3520066
[2]
Amir Abboud, Seri Khoury, Oree Leibowitz, and Ron Safier. 2022. Listing 4-Cycles. Manuscript.
[3]
Amir Abboud, Kevin Lewi, and Ryan Williams. 2014. Losing Weight by Gaining Edges. In 22th Annual European Symposium on Algorithms (ESA 2014) (Lecture Notes in Computer Science, Vol. 8737). Springer, 1–12. https://doi.org/10.1007/978-3-662-44777-2_1
[4]
Amir Abboud and Virginia Vassilevska Williams. 2014. Popular conjectures imply strong lower bounds for dynamic problems. In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. 434–443.
[5]
Maor Akav and Liam Roditty. 2020. An almost 2-approximation for all-pairs of shortest paths in subquadratic time. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, Shuchi Chawla (Ed.). SIAM, 1–11. https://doi.org/10.1137/1.9781611975994.1
[6]
Josh Alman and Virginia Vassilevska Williams. 2021. A refined laser method and faster matrix multiplication. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). 522–539.
[7]
Noga Alon, Raphael Yuster, and Uri Zwick. 1997. Finding and Counting Given Length Cycles. Algorithmica, 17, 3 (1997), 209–223. https://doi.org/10.1007/BF02523189
[8]
Andrew Arnold and Daniel S. Roche. 2015. Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication. In Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation. ACM, 29–36. https://doi.org/10.1145/2755996.2756653
[9]
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, and David Peleg. 1998. Near-linear time construction of sparse neighborhood covers. SIAM J. Comput., 28, 1 (1998), 263–277.
[10]
Antal Balog. 2007. Many additive quadruples. In Additive Combinatorics (CRM Proc. Lecture Notes, Vol. 43). Amer. Math. Soc., 39–49. https://doi.org/10.1090/crmp/043
[11]
Antal Balog and Endre Szemerédi. 1994. A statistical theorem of set addition. Combinatorica, 14 (1994), 263–268. https://doi.org/10.1007/BF01212974
[12]
Ilya Baran, Erik D. Demaine, and Mihai Patrascu. 2008. Subquadratic Algorithms for 3SUM. Algorithmica, 50, 4 (2008), 584–596. https://doi.org/10.1007/s00453-007-9036-3
[13]
Surender Baswana, Akshay Gaur, Sandeep Sen, and Jayant Upadhyay. 2008. Distance oracles for unweighted graphs: Breaking the quadratic barrier with constant additive error. In International Colloquium on Automata, Languages, and Programming. 609–621.
[14]
Surender Baswana, Vishrut Goyal, and Sandeep Sen. 2009. All-pairs nearly 2-approximate shortest paths in I time. Theor. Comput. Sci., 410, 1 (2009), 84–93. https://doi.org/10.1016/j.tcs.2008.10.018
[15]
Surender Baswana and Telikepalli Kavitha. 2010. Faster algorithms for all-pairs approximate shortest paths in undirected graphs. SIAM J. Comput., 39, 7 (2010), 2865–2896.
[16]
Surender Baswana and Sandeep Sen. 2006. Approximate distance oracles for unweighted graphs in expected O(n^2) time. ACM Transactions on Algorithms (TALG), 2, 4 (2006), 557–577.
[17]
Uri Ben-Levy and Merav Parter. 2020. New (α, β ) Spanners and Hopsets. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, Shuchi Chawla (Ed.). SIAM, 1695–1714. https://doi.org/10.1137/1.9781611975994.104
[18]
Etienne Birmelé, Rui Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, and Gustavo Sacomoto. 2013. Optimal listing of cycles and st-paths in undirected graphs. In Proceedings of the twenty-fourth annual ACM-SIAM Symposium on Discrete Algorithms. 1884–1896.
[19]
Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, and Uri Zwick. 2014. Listing triangles. In International Colloquium on Automata, Languages, and Programming. 223–234.
[20]
Jean Bourgain. 1985. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel Journal of Mathematics, 52, 1-2 (1985), 46–52.
[21]
Karl Bringmann, Nick Fischer, and Vasileios Nakos. 2021. Sparse nonnegative convolution is equivalent to dense nonnegative convolution. In 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2021). ACM, 1711–1724. https://doi.org/10.1145/3406325.3451090
[22]
Karl Bringmann, Nick Fischer, and Vasileios Nakos. 2022. Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. In 33th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022). SIAM, 3069–3090. https://doi.org/10.1137/1.9781611977073.119
[23]
Timothy M. Chan and Qizheng He. 2020. Reducing 3SUM to Convolution-3SUM. In 3rd Symposium on Simplicity in Algorithms (SOSA 2020). SIAM, 1–7. https://doi.org/10.1137/1.9781611976014.1
[24]
Timothy M. Chan and Moshe Lewenstein. 2015. Clustered Integer 3SUM via Additive Combinatorics. In 47th Annual ACM Symposium on Theory of Computing (STOC 2015). ACM, 31–40. https://doi.org/10.1145/2746539.2746568
[25]
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, and Oren Weimann. 2019. Almost optimal distance oracles for planar graphs. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, Moses Charikar and Edith Cohen (Eds.). ACM, 138–151. https://doi.org/10.1145/3313276.3316316
[26]
Shiri Chechik. 2014. Approximate distance oracles with constant query time. In Symposium on Theory of Computing, STOC 2014, David B. Shmoys (Ed.). ACM, 654–663. https://doi.org/10.1145/2591796.2591801
[27]
Shiri Chechik. 2015. Approximate Distance Oracles with Improved Bounds. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, Rocco A. Servedio and Ronitt Rubinfeld (Eds.). ACM, 1–10. https://doi.org/10.1145/2746539.2746562
[28]
Shiri Chechik. 2018. Near-optimal approximate decremental all pairs shortest paths. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). 170–181.
[29]
Shiri Chechik and Tianyi Zhang. 2022. Nearly 2-Approximate Distance Oracles in Subquadratic Time. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, (SODA 2022), Joseph (Seffi) Naor and Niv Buchbinder (Eds.). SIAM, 551–580. https://doi.org/10.1137/1.9781611977073.26
[30]
Edith Cohen. 1998. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput., 28, 1 (1998), 210–236.
[31]
Edith Cohen and Uri Zwick. 2001. All-pairs small-stretch paths. Journal of Algorithms, 38, 2 (2001), 335–353.
[32]
Richard Cole and Ramesh Hariharan. 2002. Verifying candidate matches in sparse and wildcard matching. In Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, John H. Reif (Ed.). ACM, 592–601. https://doi.org/10.1145/509907.509992
[33]
Mina Dalirooyfard, Ce Jin, Virginia Vassilevska Williams, and Nicole Wein. 2022. Approximation Algorithms and Hardness for n -Pairs Shortest Paths and All-Nodes Shortest Cycles. arXiv preprint arXiv:2204.03076.
[34]
Dorit Dor, Shay Halperin, and Uri Zwick. 2000. All-pairs almost shortest paths. SIAM J. Comput., 29, 5 (2000), 1740–1759.
[35]
Michal Dory, Sebastian Forster, Yasamin Nazari, and Tijn de Vos. 2022. New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. CoRR, abs/2211.01152 (2022), https://doi.org/10.48550/arXiv.2211.01152 arXiv:2211.01152.
[36]
Ran Duan, Hongxun Wu, and Renfei Zhou. 2022. Faster Matrix Multiplication via Asymmetric Hashing. CoRR, abs/2210.10173 (2022), https://doi.org/10.48550/arXiv.2210.10173 arXiv:2210.10173.
[37]
Michael Elkin and David Peleg. 2004. (1+eps,beta)-spanner constructions for general graphs. SIAM J. Comput., 33, 3 (2004), 608–631.
[38]
Sebastian Forster, Gramoz Goranci, and Monika Henzinger. 2021. Dynamic maintenance of low-stretch probabilistic tree embeddings with applications. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). 1226–1245.
[39]
Anka Gajentaan and Mark H. Overmars. 1995. On a Class of O(n^2) Problems in Computational Geometry. Comput. Geom., 5 (1995), 165–185. https://doi.org/10.1016/0925-7721(95)00022-2
[40]
Timothy W. Gowers. 2001. A new proof of Szemerédi’s theorem. GAFA Geometric And Functional Analysis, 11 (2001), 08, 465–588. https://doi.org/10.1007/s00039-001-0332-9
[41]
Maximilian Probst Gutenberg and Christian Wulff-Nilsen. 2020. Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA 2020). SIAM, 2522–2541. https://doi.org/10.1137/1.9781611975994.154
[42]
Ce Jin and Yinzhan Xu. 2023. Removing Additive Structure in 3SUM-Based Reductions. In 55th Annual ACM Symposium on Theory of Computing (STOC 2023). ACM. https://doi.org/10.48550/arXiv.2211.07058 To appear
[43]
Mathias Bæ k Tejs Knudsen. 2016. Linear Hashing Is Awesome. In 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016). IEEE Computer Society, 345–352. https://doi.org/10.1109/FOCS.2016.45
[44]
Mathias Bæ k Tejs Knudsen. 2017. Additive spanners and distance oracles in quadratic time. arXiv preprint arXiv:1704.04473.
[45]
Tsvi Kopelowitz, Seth Pettie, and Ely Porat. 2016. Higher Lower Bounds from the 3SUM Conjecture. In 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016). SIAM, 1272–1287. https://doi.org/10.1137/1.9781611974331.ch89
[46]
Hung Le and Christian Wulff-Nilsen. 2021. Optimal Approximate Distance Oracle for Planar Graphs. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. IEEE, 363–374. https://doi.org/10.1109/FOCS52979.2021.00044
[47]
Yaowei Long and Seth Pettie. 2021. Planar Distance Oracles with Better Time-Space Tradeoffs. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, Dániel Marx (Ed.). SIAM, 2517–2537. https://doi.org/10.1137/1.9781611976465.149
[48]
Jiří Matoušek. 1996. On the distortion required for embedding finite metric spaces into normed spaces. Israel Journal of Mathematics, 93, 1 (1996), 333–344.
[49]
Manor Mendel and Assaf Naor. 2007. Ramsey partitions and proximity data structures. Journal of the European Mathematical Society, 9, 2 (2007), 253–275.
[50]
Vasileios Nakos. 2020. Nearly Optimal Sparse Polynomial Multiplication. IEEE Trans. Inf. Theory, 66, 11 (2020), 7231–7236. https://doi.org/10.1109/TIT.2020.2989385
[51]
Merav Parter. 2014. Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.) (Lecture Notes in Computer Science, Vol. 8573). Springer, 608–619. https://doi.org/10.1007/978-3-662-43951-7_49
[52]
Mihai Patrascu and Liam Roditty. 2014. Distance Oracles beyond the Thorup-Zwick Bound. SIAM J. Comput., 43, 1 (2014), 300–311. https://doi.org/10.1137/11084128X The conference version appeared in FOCS 2010
[53]
Mihai Patrascu, Liam Roditty, and Mikkel Thorup. 2012. A New Infinity of Distance Oracles for Sparse Graphs. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012. IEEE Computer Society, 738–747. https://doi.org/10.1109/FOCS.2012.44
[54]
Helmut Plünnecke. 1970. Eine zahlentheoretische Anwendung der Graphentheorie. Journal für die reine und angewandte Mathematik, 1970, 243 (1970), 171–183. https://doi.org/
[55]
Mihai Pătraşcu. 2010. Towards polynomial lower bounds for dynamic problems. In 42nd Annual ACM Symposium on Theory of Computing (STOC 2010). ACM, 603–610. https://doi.org/10.1145/1806689.1806772
[56]
Zichao Qi, Yanghua Xiao, Bin Shao, and Haixun Wang. 2013. Toward a distance oracle for billion-node graphs. Proceedings of the VLDB Endowment, 7, 1 (2013), 61–72.
[57]
Liam Roditty and Roei Tov. 2021. Approximate Distance Oracles with Improved Stretch for Sparse Graphs. In Computing and Combinatorics - 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings, Chi-Yeh Chen, Wing-Kai Hon, Ling-Ju Hung, and Chia-Wei Lee (Eds.) (Lecture Notes in Computer Science, Vol. 13025). Springer, 89–100. https://doi.org/10.1007/978-3-030-89543-3_8
[58]
Imre Z. Ruzsa. 1999. An analog of Freiman’s theorem in groups. In Structure theory of set addition (Astérisque). Société mathématique de France. http://www.numdam.org/item/AST_1999__258__323_0/
[59]
Christian Sommer. 2016. All-pairs approximate shortest paths and distance oracle preprocessing. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016).
[60]
Christian Sommer, Elad Verbin, and Wei Yu. 2009. Distance oracles for sparse graphs. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science. 703–712.
[61]
Benny Sudakov, Endre Szemerédi, and Van H. Vu. 2005. On a question of Erdős and Moser. Duke Mathematical Journal, 129, 1 (2005), 129–155. https://doi.org/10.1215/S0012-7094-04-12915-X
[62]
Terence Tao and Van H. Vu. 2006. Additive Combinatorics. Cambridge University Press. https://doi.org/10.1017/CBO9780511755149
[63]
Mikkel Thorup and Uri Zwick. 2005. Approximate distance oracles. Journal of the ACM (JACM), 52, 1 (2005), 1–24.
[64]
Virginia Vassilevska Williams and Yinzhan Xu. 2020. Monochromatic Triangles, Triangle Listing and APSP. In 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2020). IEEE, 786–797. https://doi.org/10.1109/FOCS46700.2020.00078
[65]
Christian Wulff-Nilsen. 2012. Approximate distance oracles with improved preprocessing time. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), Yuval Rabani (Ed.). SIAM, 202–208. https://doi.org/10.1137/1.9781611973099.18
[66]
Christian Wulff-Nilsen. 2013. Approximate Distance Oracles with Improved Query Time. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, (SODA 2013), Sanjeev Khanna (Ed.). SIAM, 539–549. https://doi.org/10.1137/1.9781611973105.39
[67]
Raphael Yuster and Uri Zwick. 1997. Finding Even Cycles Even Faster. SIAM J. Discret. Math., 10, 2 (1997), 209–222. https://doi.org/10.1137/S0895480194274133 The conference version appeared in ICALP 1994.
Index Terms
- Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics
Recommendations
Removing Additive Structure in 3SUM-Based Reductions
STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of ComputingOur work explores the hardness of 3SUM instances without certain additive structures, and its applications. As our main technical result, we show that solving 3SUM on a size-n integer set that avoids solutions to a+b=c+d for {a, b} ≠ {c, d} still ...
Clustered Integer 3SUM via Additive Combinatorics
STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of ComputingWe present a collection of new results on problems related to 3SUM, including: The first truly subquadratic algorithm for computing the (min,+) convolution for monotone increasing sequences with integer values bounded by O(n), solving 3SUM for monotone ...
Towards polynomial lower bounds for dynamic problems
STOC '10: Proceedings of the forty-second ACM symposium on Theory of computingWe consider a number of dynamic problems with no known poly-logarithmic upper bounds, and show that they require nΩ(1) time per operation, unless 3SUM has strongly subquadratic algorithms. Our result is modular: (1) We describe a carefully-chosen ...
Comments
Information & Contributors
Information
Published In
June 2023
1926 pages
Copyright © 2023 Owner/Author.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 02 June 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
STOC '23
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 386Total Downloads
- Downloads (Last 12 months)253
- Downloads (Last 6 weeks)35
Reflects downloads up to 17 Oct 2024
Other Metrics
Citations
Cited By
View all- Van Den Brand JKarczmarz A(2023)Deterministic Fully Dynamic SSSP and More2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00142(2312-2321)Online publication date: 6-Nov-2023
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in