📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

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

First Author: Konrad C

Attributed to: StreamDG: Streaming Processing of Massive Dynamic Graphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1137/1.9781611977912.102

Publication URI: http://dx.doi.org/10.1137/1.9781611977912.102

Type: Book Chapter

Book Title: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2024)

Page Reference: 2881-2899