arXiv (All)
open access
Faster high-accuracy multicommodity flow in dense graphs
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Nearly balanced spanning subdivisions in dense digraphs#609602
- Approximation and Hardness Results for the Parallel-Block Construction Problem / Arivarasan Karmegam, Alexandru Popa, Lucianna Kiffer, Antonio Fernández Anta#1188461
- Certified computations on no-three-in-line problems: exact values and witnesses in the cube, and the Guy-Kelly count in the plane#1051626
- Volumetric path following algorithms for linear programming#429974
- Fractional list packing for layered graphs#131249
Record · ID 1215758
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive