Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
In this paper, we consider two fundamental cut approximation problems on large graphs. We prove new lower bounds for both problems that are optimal up to logarithmic factors. The first problem is to approximate cuts in balanced directed graphs. In this problem, the goal is to build a data structure...
Gespeichert in:
| Veröffentlicht in: | Proceedings of the ACM on management of data Jg. 2; H. 2 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
United States
01.05.2024
|
| ISSN: | 2836-6573, 2836-6573 |
| Online-Zugang: | Weitere Angaben |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!