Related papers: Steiner Ratio for Manifolds
Assume that we observe i.i.d.~points lying close to some unknown $d$-dimensional $\mathcal{C}^k$ submanifold $M$ in a possibly high-dimensional space. We study the problem of reconstructing the probability distribution generating the…
In this paper, we investigate the geometry of Einstein-type equation on a Riemannian manifold, unifying various particular geometric structures recently studied in the literature, such as critical point equation and vacuum static equation.…
We are concerned in this article with a classical topic in spectral geometry dating back to McKean-Singer, Patodi and Tanno: whether or not the constancy of sectional curvature (resp. holomorphic sectional curvature) of a compact Riemannian…
We introduce a novel concept of coarse extrinsic curvature for Riemannian submanifolds, inspired by Ollivier's notion of coarse Ricci curvature. This curvature is derived from the Wasserstein 1-distance between probability measures…
We examine the total mixed scalar curvature of a fixed distribution as a functional of a pseudo-Riemannian metric. We develop variational formulas for quantities of extrinsic geometry of the distribution to find the critical points of this…
We study a natural Wasserstein gradient flow on manifolds of probability distributions with discrete sample spaces. We derive the Riemannian structure for the probability simplex from the dynamical formulation of the Wasserstein distance on…
The concept of $n$-distance was recently introduced to generalize the classical definition of distance to functions of $n$ arguments. In this paper we investigate this concept through a number of examples based on certain geometrical…
The minimum spanning tree (MST) is a combinatorial optimization problem: given a connected graph with a real weight ("cost") on each edge, find the spanning tree that minimizes the sum of the total cost of the occupied edges. We consider…
We find the equations that allow us to compute the position of the two interior nodes (weighted Fermat-Torricelli points) w.r. to the weighted Steiner problem for four points determining a tetrahedron in R^3. Furthermore, by applying the…
In this note, we obtain a sharp volume estimate for complete gradient Ricci solitons with scalar curvature bounded below by a positive constant. Using Chen-Yokota's argument we obtain a local lower bound estimate of the scalar curvature for…
Let $M$ be a complete, simply connected Riemannian manifold with negative curvature. We obtain some Moser-Trudinger inequalities with sharp constants on $M$.
In the present paper we investigate the metric space $\cal M$ consisting of isometry classes of compact metric spaces, endowed with the Gromov-Hausdorff metric. We show that for any finite subset $M$ from a sufficiently small neighborhood…
The cost-distance Steiner tree problem seeks a Steiner tree that minimizes the total congestion cost plus the weighted sum of source-sink delays. This problem arises as a subroutine in timing-constrained global routing with a linear delay…
We consider the geometric inverse problem of determining a closed Riemannian manifold from measurements of the heat kernel in an open subset of the manifold. In this paper we analyze the stability of this problem in the class of…
Prize-Collecting Steiner Tree (PCST) is a generalization of the Steiner Tree problem, a fundamental problem in computer science. In the classic Steiner Tree problem, we aim to connect a set of vertices known as terminals using the…
With applications in distribution systems and communication networks, the minimum stretch spanning tree problem is to find a spanning tree T of a graph G such that the maximum distance in T between two adjacent vertices is minimized. The…
We consider the $k$-prize-collecting Steiner tree problem. An instance is composed of an integer $k$ and a graph $G$ with costs on edges and penalties on vertices. The objective is to find a tree spanning at least $k$ vertices which…
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…
Some curvature estimates are derived from geometrical data concerning quasi-conformality properties of some commuting linearly independent vector fields on a compact Riemannian manifold.
The Steiner Tree problem is a classical problem in combinatorial optimization: the goal is to connect a set $T$ of terminals in a graph $G$ by a tree of minimum size. Karpinski and Zelikovsky (1996) studied the $\delta$-dense version of…