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...
Uloženo v:
| Vydáno v: | Proceedings of the ACM on management of data Ročník 2; číslo 2 |
|---|---|
| Hlavní autoři: | , , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
United States
01.05.2024
|
| ISSN: | 2836-6573, 2836-6573 |
| On-line přístup: | Zjistit podrobnosti o přístupu |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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 that
-approximates cut values in graphs with
vertices. For arbitrary directed graphs, such a data structure requires
bits even for constant
. To circumvent this, recent works study
-balanced graphs, meaning that for every directed cut, the total weight of edges in one direction is at most
times that in the other direction. We consider two models: the
model, where the goal is to approximate each cut with constant probability, and the
model, where all cuts must be preserved simultaneously. We improve the previous
lower bound to
in the for-each model, and we improve the previous
lower bound to
in the for-all model. This resolves the main open questions of (Cen et al., ICALP, 2021). The second problem is to approximate the global minimum cut in a local query model, where we can only access the graph via degree, edge, and adjacency queries. We improve the previous
query complexity lower bound to
for this problem, where
is the number of edges,
is the size of the minimum cut, and we seek a
-approximation. In addition, we show that existing upper bounds with slight modifications match our lower bound up to logarithmic factors. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 2836-6573 2836-6573 |
| DOI: | 10.1145/3651148 |