We revisit the problem max-min degree arborescence, which was introduced by Bateni et al. [STOC'09] as a central special case of the general Santa Claus problem, which constitutes a notorious open question in approximation algorithms. In the former problem ...
In this work, we develop a new framework for dynamic network flow pro-blems based on optimal transport theory. We show that the dynamic multicommodity minimum-cost network flow problem can be formulated as a multimarginal optimal transport problem, where t ...
Efficient numerical simulations of coupled multi-component systems can be particularly challenging. This is mostly due to the complexity of their solutions, as mutual interactions may cause emergent behaviors, including synchronization and instabilities. V ...
Microscopic traffic flow models can be distinguished in lane-based or lane-free depending on the degree of lane-discipline. This distinction holds true only if motorcycles are neglected in lane-based traffic. In cities, as opposed to highways, this is an o ...
This thesis focuses on two selected learning problems: 1) statistical inference on graphs models, and, 2) gradient descent on neural networks, with the common objective of defining and analysing the measures that characterize the fundamental limits.In th ...
In control system networks, reconfiguration of the controller when agents are leaving or joining the network is still an open challenge, in particular when operation constraints that depend on each agent's behavior must be met. Drawing our motivation from ...
