Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
Summary: Lower bounds for beta-balanced directed-cut sparsification: for-each Ω(n√β/ε), for-all Ω(nβ/ε^2), resolving Cen et al.'s ICALP'21 questions. In a local-query model, Ω(min{m, m/(ε^2k)}) for (1+ε)-approximate global min-cut; upper bounds are near-tight. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yu Cheng (Brown University)
- 2. Max Li (Carnegie Mellon University)
- 3. Honghao Lin (Carnegie Mellon University)
- 4. Zi-Yi Tai (Carnegie Mellon University)
- 5. David P. Woodruff (Carnegie Mellon University)
- 6. Jason Zhang (Carnegie Mellon University)
BibTeX Citation
@inproceedings{cheng_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut}},
url = {https://dl.acm.org/doi/10.1145/3651148},
doi = {10.1145/3651148},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Cheng, Yu and Li, Max and Lin, Honghao and Tai, Zi-Yi and Woodruff, David P. and Zhang, Jason},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,162 | On Sketching Trimmed Statistics | 2026 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,146 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS | 0.00011984702 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,623 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB |
| 2 | 9,387 | Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs | 2024 | VLDB |
| 3 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 4 | 11,520 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS |
| 5 | 9,538 | Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation | 2025 | PODS |
| 6 | 5,370 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 7 | 3,559 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB |
| 8 | 1,884 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD |
| 9 | 4,474 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD |
| 10 | 10,152 | Deterministic Lower Bounds for k-Edge Connectivity in the Distributed Sketching Model | 2026 | PODS |