Improved Upper Bounds for the Directed Flow-Cut Gap
[Submitted on 3 Apr 2026 (v1), last revised 9 Jul 2026 (this ver
·
2026-04-04
·
via math updates on arXiv.org
arXiv:2604.03412v3 Announce Type: replace-cross Abstract: We prove that the flow-cut gap for $n$-node directe…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。