Related papers: On minimizers of the maximal distance functional f…

Let $G$ be a connected graph and $W$ be a set of vertices of $G$. The representation multiset of a vertex $v$ with respect to $W$, $r_m (v|W)$, is defined as a multiset of distances between $v$ and the vertices in $W$. If $r_m (u |W) \neq…

We study the problem of finding approximate first-order stationary points in optimization problems of the form $\min_{x \in X} \max_{y \in Y} f(x,y)$, where the sets $X,Y$ are convex and $Y$ is compact. The objective function $f$ is smooth,…

The Steiner distance of vertices in a set $S$ is the minimum size of a connected subgraph that contain these vertices. The sum of the Steiner distances over all sets $S$ of cardinality $k$ is called the Steiner $k$-Wiener index and studied…

The problem of finding the minimizer of a sum of convex functions is central to the field of optimization. Thus, it is of interest to understand how that minimizer is related to the properties of the individual functions in the sum. In this…

We look for the minimizers of the functional $\jla{\la}(\oo)=\la|\oo|-P(\oo)$ among planar convex domains constrained to lie into a given ring. We prove that, according to the values of the parameter $\la$, the solutions are either a disc…

We study two problems that seek a subtree $T$ of a graph $G=(V,E)$ such that $T$ satisfies a certain property and has minimal maximum degree. - In the Min-Degree Group Steiner Tree problem we are given a collection ${\cal S}$ of groups…

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…

Let $G$ be a connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity and remoteness of $G$ are defined as the minimum and maximum,…

Maximum parsimony distance is a measure used to quantify the dissimilarity of two unrooted phylogenetic trees. It is NP-hard to compute, and very few positive algorithmic results are known due to its complex combinatorial structure. Here we…

Approximating a quantum state by the convex mixing of some given states has strong experimental significance and provides potential applications in quantum resource theory. Here we find a closed form of the minimal distance in the sense of…

In this paper we consider variational problems involving 1-dimensional connected sets in the Euclidean plane, such as the classical Steiner tree problem and the irrigation (Gilbert-Steiner) problem. We relate them to optimal partition…

This paper introduces an exact algorithm for the construction of a shortest curvature-constrained network interconnecting a given set of directed points in the plane and an iterative method for doing so in 3D space. Such a network will be…

The tree spanner problem for a graph $G$ is as follows: For a given integer $k$, is there a spanning tree $T$ of $G$ (called a tree $k$-spanner) such that the distance in $T$ between every pair of vertices is at most $k$ times their…

Generically, a fully measured elasticity tensor has no material symmetry. For single crystals with a cubic lattice, or for the aeronautics turbine blades superalloys such as Nickelbased CMSX-4, cubic symmetry is nevertheless expected. It is…

We prove that the boundary distance map of a smooth compact Finsler manifold with smooth boundary determines its topological and differentiable structures. We construct the optimal fiberwise open subset of its tangent bundle and show that…

The concept of natural pseudo-distance has proven to be a powerful tool for measuring the dissimilarity between topological spaces endowed with continuous real-valued functions. Roughly speaking, the natural pseudo-distance is defined as…

For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the \emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $n$ and $k$ be two…

We propose a solution to the tenth of Professor Clark Kimberling's unsolved problems found on https://faculty.evansville.edu/ck6/integer/unsolved.html. We are required to find the parametric equations of a simple and closed curve $C$ on the…

In this article, we consider and analyse a small variant of a functional originally introduced in \cite{BLS,LS} to approximate the (geometric) planar Steiner problem. This functional depends on a small parameter $\varepsilon>0$ and…

In this paper we define a notion of calibration for an equivalent approach to the classical Steiner problem in a covering space setting and we give some explicit examples. Moreover we introduce the notion of calibration in families: the…