Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Worst-Case to Expander-Case Reductions: Derandomized and Generalized (2403.08394v2)

Published 13 Mar 2024 in cs.DS

Abstract: A paper by Abboud and Wallheimer [ITCS 2023] presents self-reductions for various fundamental graph problems, which transform worst-case instances to expanders, thus proving that the complexity remains unchanged if the input is assumed to be an expander. An interesting corollary of their self-reductions is that if some problem admits such reduction, then the popular algorithmic paradigm based on expander-decompositions is useless against it. In this paper, we improve their core gadget, which augments a graph to make it an expander while retaining its important structure. Our new core construction has the benefit of being simple to analyze and generalize while obtaining the following results: 1. A derandomization of the self-reductions, showing that the equivalence between worst-case and expander-case holds even for deterministic algorithms, and ruling out the use of expander-decompositions as a derandomization tool. 2. An extension of the results to other models of computation, such as the Fully Dynamic model and the Congested Clique model. In the former, we either improve or provide an alternative approach to some recent hardness results for dynamic expander graphs by Henzinger, Paz, and Sricharan [ESA 2022]. In addition, we continue this line of research by designing new self-reductions for more problems, such as Max-Cut and dynamic Densest Subgraph, and demonstrating that the core gadget can be utilized to lift lower bounds based on the OMv Conjecture to expanders.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (46)
  1. If the current clique algorithms are optimal, so is Valiant’s parser. SIAM J. Comput., 47(6):2527–2555, 2018. doi:10.1137/16M1061771.
  2. Subcubic algorithms for gomory-hu tree in unweighted graphs. In Samir Khuller and Virginia Vassilevska Williams, editors, STOC ’21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pages 1725–1737. ACM, 2021. doi:10.1145/3406325.3451073.
  3. Worst-case to expander-case reductions. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023.
  4. Popular conjectures imply strong lower bounds for dynamic problems. In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pages 434–443. IEEE, 2014.
  5. Expander decomposition with fewer inter-cluster edges using a spectral cut player. CoRR, abs/2205.10301, 2022. arXiv:2205.10301, doi:10.48550/arXiv.2205.10301.
  6. Graph clustering using effective resistance. arXiv preprint arXiv:1711.06530, 2017.
  7. Noga Alon. Explicit expanders of every degree and size. Combinatorica, pages 1–17, 2021.
  8. Sublinear time shortest path in expander graphs. arXiv preprint arXiv:2307.06113, 2023.
  9. Dynamic algorithms against an adaptive adversary: Generic constructions and lower bounds. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 1671–1684, 2022.
  10. Lifts, discrepancy and nearly optimal spectral gap. Combinatorica, 26(5):495–519, 2006.
  11. Reducing 3sum to convolution-3sum. In Symposium on Simplicity in Algorithms, pages 1–7. SIAM, 2020.
  12. Distributed triangle detection via expander decomposition. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 821–840. SIAM, 2019.
  13. Improved distributed expander decomposition and nearly optimal triangle enumeration. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pages 66–73, 2019.
  14. Maximum flow and minimum-cost flow in almost-linear time. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 612–623. IEEE, 2022.
  15. Guest column: New ways of studying the bpp= p conjecture. ACM SIGACT News, 54(2):44–69, 2023.
  16. A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 1158–1167. IEEE, 2020.
  17. Expander decomposition in dynamic streams. arXiv preprint arXiv:2211.11384, 2022.
  18. Deterministic 3sum-hardness. arXiv preprint arXiv:2310.12913, 2023.
  19. Distributed mst and routing in almost mixing time. In Proceedings of the ACM Symposium on Principles of Distributed Computing, pages 131–140, 2017.
  20. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM (JACM), 42(6):1115–1145, 1995.
  21. Andrew V Goldberg. Finding a maximum density subgraph, 1984.
  22. Sorting, searching, and simulation in the mapreduce framework. In International Symposium on Algorithms and Computation, pages 374–383. Springer, 2011.
  23. The expander hierarchy and its applications to dynamic graph algorithms. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2212–2228. SIAM, 2021.
  24. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In Proceedings of the forty-seventh annual ACM symposium on Theory of computing, pages 21–30, 2015.
  25. Deterministic near-linear time minimum cut in weighted graphs. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3089–3139. SIAM, 2024.
  26. Fine-grained complexity lower bounds for families of dynamic graphs. In 30th Annual European Symposium on Algorithms (ESA 2022). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2022.
  27. Combinatorial approximation algorithms for maxcut using random walks. arXiv preprint arXiv:1008.3938, 2010.
  28. On clusterings: Good, bad and spectral. Journal of the ACM (JACM), 51(3):497–515, 2004.
  29. Deterministic edge connectivity in near-linear time. J. ACM, 66(1):4:1–4:50, 2019. doi:10.1145/3274663.
  30. Jason Li. Deterministic mincut in almost-linear time. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 384–395, 2021.
  31. Deterministic min-cut in poly-logarithmic max-flows. In Sandy Irani, editor, 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pages 85–92. IEEE, 2020. doi:10.1109/FOCS46700.2020.00017.
  32. A new approach to estimating effective resistances and counting spanning trees in expander graphs. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2728–2745. SIAM, 2023.
  33. Dynamic minimum spanning forest with subpolynomial worst-case update time. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pages 950–961. IEEE, 2017.
  34. On partitioning graphs via single commodity flows. In Proceedings of the fortieth annual ACM symposium on Theory of computing, pages 461–470, 2008.
  35. A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction. SIAM Journal on Computing, 30(5):1427–1442, 2000.
  36. Sublinear-time algorithms for max cut, max e2lin (q), and unique label cover on expanders. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4936–4965. SIAM, 2023.
  37. Thatchaphol Saranurak. A simple deterministic algorithm for edge connectivity. In Symposium on Simplicity in Algorithms (SOSA), pages 80–85. SIAM, 2021.
  38. Thatchaphol Saranurak and Di Wang. Expander decomposition and pruning: Faster, stronger, and simpler. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2616–2635. SIAM, 2019.
  39. Thatchaphol Saranurak and Di Wang. Expander decomposition and pruning: Faster, stronger, and simpler. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pages 2616–2635, 2019. doi:10.1137/1.9781611975482.162.
  40. Distance oracles for sparse graphs. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pages 703–712. IEEE, 2009.
  41. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 81–90, 2004.
  42. Luca Trevisan. Max cut and the smallest eigenvalue. In Proceedings of the forty-first annual ACM symposium on Theory of computing, pages 263–272, 2009.
  43. Virginia Vassilevska. Efficient algorithms for clique problems. Information Processing Letters, 109(4):254–257, 2009.
  44. Ryan Williams. A new algorithm for optimal 2-constraint satisfaction and its implications. Theoretical Computer Science, 348(2-3):357–365, 2005.
  45. Ryan Williams. Matrix-vector multiplication in sub-quadratic time:(some preprocessing required). In SODA, volume 7, pages 995–1001, 2007.
  46. Exact algorithms for maximum independent set. Information and Computation, 255:126–146, 2017.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets