An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation

Christian Konrad 0001, Kheeran K. Naidu. An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024. pages 2881-2899, SIAM, 2024. [doi]

Abstract

Abstract is missing.