Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We show in full generality the stability of optimal transport paths in branched transport: namely, we prove that any limit of optimal transport paths is optimal as well. This solves an open problem in the field (cf. Open problem 1 in the book Optimal transportation networks by Bernot, Caselles, and Morel), which has been addressed up to now only under restrictive assumptions. (c) 2020 Wiley Periodicals LLC
Michaël Unser, Sebastian Jonas Neumayer, Lénaïc Chizat