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...
Saved in:
| Published in: | Proceedings of the ACM on management of data Vol. 2; no. 2 |
|---|---|
| Main Authors: | , , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
United States
01.05.2024
|
| ISSN: | 2836-6573, 2836-6573 |
| Online Access: | Get more information |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!