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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the ACM on management of data Ročník 2; číslo 2
Hlavní autori:	Cheng, Yu, Li, Max, Lin, Honghao, Tai, Zi-Yi, Woodruff, David P, Zhang, Jason
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States 01.05.2024
ISSN:	2836-6573, 2836-6573
On-line prístup:	Zistit podrobnosti o prístupe
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!