Approximating Directed Minimum Cut and Arborescence Packing via Directed Expander Hierarchies

Documenti analoghi

• Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies
  di: Long, Yaowei, et al.
  Pubblicazione: (2024)
• Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
  di: Haeupler, Bernhard, et al.
  Pubblicazione: (2025)
• Parallel $(1+ε)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
  di: Haeupler, Bernhard, et al.
  Pubblicazione: (2025)
• Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
  di: Li, Xizhe, et al.
  Pubblicazione: (2026)
• Dynamic Deterministic Constant-Approximate Distance Oracles with $n^ε$ Worst-Case Update Time
  di: Haeupler, Bernhard, et al.
  Pubblicazione: (2024)