Year: 2026
Type: preprint
Abstract: 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 nontrivial connected averaging set.
Source: arXiv (Cornell University)
Authors: Tao, Tianyi, Yang, Bohan
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7214588014