Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut

Documenti analoghi

• Space Complexity of Minimum Cut Problems in Single-Pass Streams
  di: Ding, Matthew, et al.
  Pubblicazione: (2024)
• Tight Sampling Bounds for Eigenvalue Approximation
  di: Swartworth, William, et al.
  Pubblicazione: (2024)
• Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
  di: Hwang, Samuel, et al.
  Pubblicazione: (2024)
• The $\ell_p$-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
  di: Li, Yi, et al.
  Pubblicazione: (2022)
• Cut Sparsification and Succinct Representation of Submodular Hypergraphs
  di: Kenneth, Yotam, et al.
  Pubblicazione: (2023)