Related papers: Inverse maximal and average distance minimizer pro…
Let $\Sigma$ be a smooth Riemannian manifold, $\Gamma \subset \Sigma$ a smooth closed oriented submanifold of codimension higher than $2$ and $T$ an integral area-minimizing current in $\Sigma$ which bounds $\Gamma$. We prove that the set…
We will study an open problem pertaining to the uniqueness of minimizers for a class of variational problems emanating from Meyer's model for the decomposition of an image into a geometric part and a texture part. Mainly, we are interested…
We study the following two maximization problems related to spanning trees in the Euclidean plane. It is not known whether or not these problems are NP-hard. We present approximation algorithms with better approximation ratios for both…
Optimal transport provides a metric which quantifies the dissimilarity between probability measures. For measures supported in discrete metric spaces, finding the optimal transport distance has cubic time complexity in the size of the…
A vertex of degree one in a tree is called an end vertex and a vertex of degree at least three is called a branch vertex. For a graph $G$, let $\sigma_2$ be the minimum degree sum of two nonadjacent vertices in $G$. We consider tree…
The divergence minimization problem plays an important role in various fields. In this note, we focus on differentiable and strictly convex divergences. For some minimization problems, we show the minimizer conditions and the uniqueness of…
The Wiener index of a connected graph is defined as the sum of distances between all its unordered pairs of vertices. Characterising graphs on $n$ vertices with a fixed diameter that maximise the Wiener index is a long-standing open…
We propose here a proof of existence of a minimizer of a segmentation functional based on a priori information on target shapes, and formulated with level sets. The existence of a minimizer is very important, because it guarantees the…
We study the small-regularisation limit of the entropic optimal transport problem on the line with distance cost. While convergence of entropic minimizers is well understood in the discrete setting and in the case where the cost is…
We investigate the problem of designing a minimum cost flow network interconnecting n sources and a single sink, each with known locations in a normed space and with associated flow demands. The network may contain any finite number of…
The Steiner Tree problem asks for the cheapest way of connecting a given subset of the vertices in an undirected graph. One of the most prominent linear programming relaxations for Steiner Tree is the Bidirected Cut Relaxation (BCR).…
We consider sets in $\mathbb R^N$ which minimise, for fixed volume, the sum of the perimeter and a non-local term given by the double integral of a kernel $g:\mathbb R^N\setminus\{0\}\to \mathbb R^+$. We establish some general existence and…
In this note we prove that minimal networks enjoy minimizing properties for the length functional. A minimal network is, roughly speaking, a subset of $\mathbb{R}^2$ composed of straight segments joining at triple junctions forming angles…
In this paper we investigate the strict convexity and the differentiability properties of the stable norm, which corresponds to the homogenized surface tension for a periodic perimeter homogenization problem (in a regular and uniformly…
Tree rotations (left and right) are basic local deformations allowing to transform between two unlabeled binary trees of the same size. Hence, there is a natural problem of practically finding such transformation path with low number of…
Let $\mathcal{S}$ be the set of all positive-definite, symmetrizable integer matrices with non-zero upper and lower diagonal and $\mathcal{T}$ to be the set of all positive-definite real symmetric matrices with nonzero upper diagonal such…
We study the constrained minimum energy problem with an external field relative to the $\alpha$-Riesz kernel $|x-y|^{\alpha-n}$ of order $\alpha\in(0,n)$ for a generalized condenser $\mathbf A=(A_i)_{i\in I}$ in $\mathbb R^n$, $n\geqslant…
We study the planar least gradient problem with respect to an anisotropic norm $\phi$ for continuous boundary data. We prove existence of minimizers for strictly convex domains $\Omega$. Furthermore, we inspect the issue of uniqueness and…
Steiner and Schwarz symmetrizations, and their most important relatives, the Minkowski, Minkowski-Blaschke, fiber, inner rotational, and outer rotational symmetrizations, are investigated. The focus is on the convergence of successive…
Consider a setting where possibly sensitive information sent over a path in a network is visible to every {neighbor} of the path, i.e., every neighbor of some node on the path, thus including the nodes on the path itself. The exposure of a…