Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots

We give an \widetilde{O}(\sqrt{n})-space single-pass 0.483-approximation streaming algorithm for estimating the maximum directed cut size (Max-DICUT) in a directed graph on n vertices. This improves over an O(\log n)-space 4 / 9\lt 0.45 approximation algorithm due to Chou, Golovnev, and Velusamy (FO...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings / annual Symposium on Foundations of Computer Science s. 855 - 870
Hlavní autori:	Saxena, Raghuvansh R., Singer, Noah G., Sudan, Madhu, Velusamy, Santhoshini
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 06.11.2023
Predmet:	Approximation algorithms Computer science constraint satisfaction problem Directed graphs Estimation Smoothing methods streaming algorithms sublinear algorithms
ISSN:	2575-8454
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!