arXiv (All)
open access
A Simpler and Faster Min-Cost Flow Solver via Min-Ratio Cycles from Distance Oracles
The first almost-linear time maximum and minimum cost flow algorithm of Chen-Kyng-Liu-Peng-Probst Gutenberg-Sachdeva (FOCS 2022), reduced these flow objectives to a sequence of min-ratio cycle problems. Solving this core primitive requires approximately minimizing the ratio of a linear gradient term
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
- Faster Algorithms for $(2k-1)$-Stretch Distance Oracles#160914
- FILIGREE3D: Scaling Sparse Latent Flow Matching for Ultra-High-Resolution Image-to-3D Generation#1129511
- Divergent-Convergent Reasoning: Scaling Test-Time Compute through Structured Solution Synthesis#615276
- Divergent-Convergent Reasoning: Scaling Test-Time Compute through Structured Solution Synthesis#614309
- A Kinetic Energy Preserving and Entropy Conserving Two-Point Flux for Multi-species Compressible Flow#1071287
Record · ID 1050044
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