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
- 2. Max Li
- 3. Honghao Lin
- 4. Zi-Yi Tai
- 5. David P. Woodruff
- 6. Jason Zhang
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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,040 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS | 0.00014488943 |
Previous
Page 1 / 1
Next