Streaming Algorithms via Local Algorithms for Maximum Directed Cut

We explore the use of local algorithms in the design of streaming algorithms for the Maximum Directed Cut problem. Specifically, building on the local algorithm of Buchbinder, Feldman, Seffi, and Schwartz [BFSS15] and Censor-Hillel, Levy, and Shachnai [CLS17], we develop streaming algorithms for both adversarially and randomly ordered streams that approximate the value of maximum directed cut in bounded-degree graphs. In n-vertex graphs, for adversarially ordered streams, our algorithm uses O(n 1-Ω( 1) ) (sub-linear) space and for randomly ordered streams, our algorithm uses logarithmic space. Moreover, both algorithms require only one pass over the input stream. With a constant number of passes, we give a logarithmic-space algorithm which works even on graphs with unbounded degree on adversarially ordered streams. Our algorithms achieve any fixed constant approximation factor less than 1 2 . In the single-pass setting, this is tight: known lower bounds show that obtaining any constant approximation factor greater than 1 2 is impossible without using linear space in adversarially ordered streams Kapralov and Krachun [KK19] and Ω( √ n) space in randomly ordered streams, even on bounded degree graphs Kapralov, Khanna, and Sudan [KKS15].

In terms of techniques, our algorithms partition the vertices into a small number of different types based on the structure of their local neighborhood, ensuring that each type carries enough information about the structure to approximately simulate the local algorithm on a vertex with that type. We then develop tools to accurately estimate the frequency of each type. This allows us to simulate an execution of the local algorithm on all vertices, and thereby approximate the value of the maximum directed cut.