For an optimizer of the mailing problem in branched transportation, does it have finite graph structure in every ball outside the supports of the initial and target measures,…
Statement
For an optimizer of the mailing problem in branched transportation, does it have finite graph structure in every ball outside the supports of the initial and target measures, and is the number of branches at a branching point uniformly bounded?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.