Related papers: Generalized Steiner's Problem and its Solution wit…
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…
Stein's method is a powerful technique for proving central limit theorems in probability theory when more straightforward approaches cannot be implemented easily. This article begins with a survey of the historical development of Stein's…
Recently the authors [CCLMST23] introduced the notion of shortcut partition of planar graphs and obtained several results from the partition, including a tree cover with $O(1)$ trees for planar metrics and an additive embedding into small…
The 1-Steiner tree problem, the problem of constructing a Steiner minimum tree containing at most one Steiner point, has been solved in the Euclidean plane by Georgakopoulos and Papadimitriou using plane subdivisions called oriented…
We describe a convex relaxation for the Gilbert-Steiner problem both in $R^d$ and on manifolds, extending the framework proposed in [9], and we discuss its sharpness by means of calibration type arguments. The minimization of the resulting…
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 discuss a new approach to solve the low lying states of the Schroedinger equation. For a fairly large class of problems, this new approach leads to convergent iterative solutions, in contrast to perturbative series expansions. These…
The Euclidean Steiner tree problem, normally posed in two dimensions, seeks to connect a set of prescribed terminal nodes by placing additional nodes, known as Steiner points, with edges connecting such nodes either to another Steiner point…
Given a graph G = (V,E) with a root r in V, positive capacities {c(e)|e in E}, and non-negative lengths {l(e)|e in E}, the minimum-length (rooted) edge capacitated Steiner tree problem is to find a tree in G of minimum total length, rooted…
The Euclidean Steiner tree problem seeks the min-cost network to connect a collection of target locations, and it underlies many applications of wireless networks. In this paper, we present a study on solving the Euclidean Steiner tree…
It is shown that in the weak field approximation solutions of Brans-Dicke equations are simply related to the solutions of General Relativity equations for the same matter distribution. A simple method is developed which permits to obtain…
Quantum field theory of a damped vibrating string as the simplest dissipative scalar field investigated by its coupling with an infinit number of Klein-Gordon fields as the environment by introducing a minimal coupling method. Heisenberg…
The prize-collecting Steiner tree problem PCSTP is a well-known generalization of the classical Steiner tree problem in graphs, with a large number of practical applications. It attracted particular interest during the latest (11th) DIMACS…
A new approximate solution of vacuum and stationary Einstein field equations is obtained. This solution is constructed by means of a power series expansion of the Ernst potential in terms of two independent and dimensionless parameters…
We consider the problem of embedding the Steiner points of a Steiner tree with given topology into the rectilinear plane. Thereby, the length of the path between a distinguished terminal and each other terminal must not exceed given length…
We give a dynamic programming solution to find the minimum cost of a diameter constrained Steiner tree in case of directed graphs. Then we show a simple reduction from undirected version to the directed version to realize an algorithm of…
A general mean field theory is presented for the construction of equilibrium coarse grained models. Inverse methods that reconstruct microscopic models from low resolution experimental data can be derived as particular implementations of…
The distant graph $G = G(\mathbb{P}(Z),\triangle)$ of the projective line over the ring of integers is considered. The shortest path problem in this graph is solved by use of Klein's geometric interpretation of Euclidean continued…
We investigate how the gravitational field generated by line sources can be characterized in Brans-Dicke theory of gravity. Adapting an approach previously developed by Israel who solved the same problem in general relativity we show that…
A generalization of the Einstein equation is considered for complex line elements. Several second order semilinear partial differential equations are derived from it as semilinear field equations in uniform and isotropic spaces. The…