Metraipolis › archive › dc_2174c835db7a

Faster high-accuracy multicommodity flow in dense graphs — arXiv:2610.06665

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.06665
License (as archived)
CC0-1.0
Archived
2026-10-06T13:07:27.097Z
SHA-256 of the archived text
e02c48cb427870abf53193436eaaa878da20dbde8198d2debb0659e2f24fc382
Stable URL of this page
https://metraipolis.com/documento/dc_2174c835db7a

How to cite

Faster high-accuracy multicommodity flow in dense graphs — arXiv:2610.06665 — arXiv (en), https://arxiv.org/abs/2610.06665 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2174c835db7a (Metraipolis archive dc_2174c835db7a, sha256 e02c48cb427870abf53193436eaaa878da20dbde8198d2debb0659e2f24fc382)
BibTeX
@misc{dc2174c835db7a,
  title = {Faster high-accuracy multicommodity flow in dense graphs — arXiv:2610.06665},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.06665},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2174c835db7a; sha256 e02c48cb427870abf53193436eaaa878da20dbde8198d2debb0659e2f24fc382},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06665. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We give a fast algorithm for solving min-cost $k$-commodity flow. The basic idea is to construct an auxiliary linear program that has low rank and whose minimum value is at most $1/k$ times the minimum value of the original problem (thus, solving this auxiliary linear program will make at least $1/k$ fraction of progress in the original problem). Low-rank linear programs can be solved quickly using black-box techniques. Thus, our algorithm runs in time $\tilde{O}(\operatorname{poly}(k)(n^{2.5}+m\sqrt{n}))$ on a directed graph with $n$ vertices and $m$ edges. We do not rely on any fast matrix multiplication.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.06665 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T11:21:31.948Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).