Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots-Reference-Cited by-同舟云学术

Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots

Published:2023-11-06 Issue: Volume: Page:
ISSN:
Container-title:2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Saxena Raghuvansh R.¹,Singer Noah G.²,Sudan Madhu³,Velusamy Santhoshini⁴

Affiliation:

1. Tata Institute of Fundamental Research,Mumbai,Maharashtra,India

2. Carnegie Mellon University,Department of Computer Science,Pittsburgh,PA,USA

3. Harvard University,School of Engineering and Applied Sciences,Cambridge,MA,USA

4. Toyota Technological Institute at Chicago,Chicago,IL,USA

Funder

Google

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/10353068/10353072/10353157.pdf?arnumber=10353157

Reference20 articles.

1. Sketching Cuts in Graphs and Hypergraphs

2. Approximating matching size from random streams

3. Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph;Guruswami;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX 2017, Berkeley, CA, USA, August 16-18, 2017), ser. LIPIcs,2017

4. (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space

5. Streaming Hardness of Unique Games;Guruswami;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX 2019, Cambridge, MA, USA, September 20-22, 2019), ser. LIPIcs,2019

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06