Related papers: Some Analytics for Steiner Minimal Tree Problem fo…
We obtain two analytic solutions for the weighted Fermat-Torricelli problem in the Euclidean Plane which states that: Given three points in the Euclidean plane and a positive real number (weight) which correspond to each point, find the…
Given a metric space on n points, an {\alpha}-approximate universal algorithm for the Steiner tree problem outputs a distribution over rooted spanning trees such that for any subset X of vertices containing the root, the expected cost of…
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…
Finite element methods for a model elliptic distributed optimal control problem with pointwise state constraints are considered from the perspective of fourth order boundary value problems.
Many parametrization and mapping-related problems in geometry processing can be viewed as metric optimization problems, i.e., computing a metric minimizing a functional and satisfying a set of constraints, such as flatness. Penner…
The aim of the paper is firstly to study domains of definitions in terms of boundary conditions of minimal and maximal operators, as well as selfadjoint extensions of a minimal operator associated with the fourth-order differential operator…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
Considering a graph with unknown weights, can we find the shortest path for a pair of nodes if we know the minimal Steiner trees associated with some subset of nodes? That is, with respect to a fixed latent decision-making system (e.g., a…
We give an overview of new and existing cut- and flow-based ILP formulations for the two-stage stochastic Steiner tree problem and compare the strength of the LP relaxations.
We characterize the number of points for which there exist non-empty Terracini sets of points in $\mathbb{P}^n$. Then we study minimally Terracini finite sets of points in $\mathbb{P}^n$ and we obtain a complete description in the case of…
In this paper we discuss the Steiner property for minimal clusters in the plane with an anisotropic double density. This means that we consider the classical isoperimetric problem for clusters, but volume and perimeter are defined by using…
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with finding perfect matchings, spanning trees, or…
We study minimally Terracini finite sets of points in the projective plane and we prove that the sequence of the cardinalities of minimally Terracini sets can have any number of gaps for degree great enough.
For a given graph $G=(V,\, E)$ with a terminal set $S$ and a selected root $r\in S$, a positive integer cost and a delay on every edge and a delay constraint $D\in Z^{+}$, the shallow-light Steiner tree (\emph{SLST}) problem is to compute a…
Kesten and Lee [36] proved that the total length of a minimal spanning tree on certain random point configurations in $\mathbb{R}^d$ satisfies a central limit theorem. They also raised the question: how to make these results quantitative?…
We study the problem of finding minimum multicuts for an undirected planar graph, where all the terminal vertices are on the boundary of the outer face. This is known as an Okamura-Seymour instance. We show that for such an instance, the…
A directed network connecting a set A to a set B is a digraph containing an a-b path for each a in A and b in B. Vertices in the directed network not in A or B are called Steiner points. We show that in a finitely compact metric space in…
In this paper, making use of Theorem 2 of [5], we establish a new four critical points theorem which can be regarded as a companion to Theorem 1 of [4]. We also present an application to the Dirichlet problem for a class of quasilinear…
Given a set of $k$-colored points in the plane, we consider the problem of finding $k$ trees such that each tree connects all points of one color class, no two trees cross, and the total edge length of the trees is minimized. For $k=1$,…
We consider the stationary sine-Gordon equation on metric graphs with simple topologies. The vertex boundary conditions are provided by flux conservation and matching of derivatives at the star graph vertex. Exact analytical solutions are…