arXiv (All)
open access
A Uniform Bound on Optimal Strategy Length in Water Transport Problem
We prove that every water transport problem on an $n$-vertex graph has an optimal strategy of length at most $n^{(2+o(1))n}$. More strongly, the convex hull of all strategy operators stabilizes within the same bound. We also give a five-vertex instance in which every optimal strategy repeats a nontr
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
- Rainbow Turán numbers for paths of length four#1142774
- An analogue of a problem of Littlewood#490218
- Hoffman-type Results for the Sum of k Largest Eigenvalues of a Graph#1049443
- SWAP: A Scalable, Warm-Startable, Anytime Permutation Solver for Optimal Transport#1064579
- Eva, Hartmann and Rad on Kullback-Leibler Minimization#171208
Record · ID 1105491
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