相关论文: A simple phase-field approximation of the Steiner …
We extend a dimensional upper bound on how much an optimal transport map can degenerate for the quadratic transportation cost, originally due to Caffarelli, to cost functions that satisfy the curvature condition of Ma, Trudinger, and Wang.
The \emph{Steiner tree} problem is one of the fundamental and classical problems in combinatorial optimization. In this paper, we study this problem in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$ model of distributed computing and present…
The Steiner tree problem can be stated in terms of finding a connected set of minimal length containing a given set of finitely many points. We show how to formulate it as a mass-minimization problem for $1$-dimensional currents with…
Variational models for cohesive fracture are based on the idea that the fracture energy is released gradually as the crack opening grows. Recently, [Conti, Focardi, and Iurlano, Ann. Inst. H. Poincar\'e C Anal. Non Lin\'eaire, 2016]…
We solve here completely an irrigation problem from a Dirac mass to the Lebesgue measure. The functional we consider is a two dimensional analog of a functional previously derived in the study of branched patterns in type-I superconductors.…
We introduce an optimal transport topology on the space of probability measures over a fiber bundle, which penalizes the transport cost from one fiber to another. For simplicity, we illustrate our construction in the Euclidean case…
The problem of branched transportation aims to describe the movement of masses when, due to concavity effects, they have the interest to travel together as much as possible, because the cost for a path of length
We study the $\Gamma$-limit of Ambrosio-Tortorelli-type functionals $D_\varepsilon(u,v)$, whose dependence on the symmetrised gradient $e(u)$ is different in $\mathbb{A} u$ and in $e(u)-\mathbb{A} u$, for a $\mathbb{C}$-elliptic symmetric…
This paper studies a variant of the minimum-cost flow problem in a graph with convex cost function where the demands at the vertices are functions depending on a one-dimensional parameter $\lambda$. We devise two algorithmic approaches for…
We provide a variational approximation of Ambrosio-Tortorelli type for brittle fracture energies of piecewise-rigid solids. Our result covers both the case of geometrically nonlinear elasticity and that of linearised elasticity.
The calculus of variations is employed to find steady divergence-free velocity fields that maximize transport of a tracer between two parallel walls held at fixed concentration for one of two constraints on flow strength: a fixed value of…
A transport theory which is not restricted to the gradient and quasi-particle approximations is presented which is formulated in terms of the energy moments, or equivalently the equal-time derivatives of the one-particle Green functions. A…
We consider a new Steiner tree problem, called vertex-cover-weighted Steiner tree problem. This problem defines the weight of a Steiner tree as the minimum weight of vertex covers in the tree, and seeks a minimum-weight Steiner tree in a…
In the classical (min-cost) Steiner tree problem, we are given an edge-weighted undirected graph and a set of terminal nodes. The goal is to compute a min-cost tree S which spans all terminals. In this paper we consider the min-power…
It is well-known that plug-in statistical estimation of optimal transport suffers from the curse of dimensionality. Despite recent efforts to improve the rate of estimation with the smoothness of the problem, the computational complexity of…
In this article, we study the Euclidean minimum spanning tree problem in an imprecise setup. The problem is known as the \emph{Minimum Spanning Tree Problem with Neighborhoods} in the literature. We study the problem where the neighborhoods…
This work originates from a heart's images tracking which is to generate an apparent continuous motion, observable through intensity variation from one starting image to an ending one both supposed segmented. Given two images $\rho_0$ and…
We have constructed a lattice Wigner-Weyl code that generalizes the Buot-Jensen algorithm to the calculation of electron transport in two-dimensional circular-cylindrically symmetric structures, where the Wigner function equation is solved…
We consider the problem of N identical fermions of mass M and one distinguishable particle of mass m interacting via short-range interactions in a confined quasi-two-dimensional (quasi-2D) geometry. For N=2 and mass ratios M/m<13.6, we find…
Mass transportation problems appear in various areas of mathematics, their solutions involving cost convex potentials. Fenchel duality also represents an important concept for a wide variety of optimization problems, both from the…