相关论文: Generalized Steiner's Problem and its Solution wit…
We study a group of new methods to solve an open problem that is the shortest paths problem on a given fix-weighted instance. It is the real significance at a considerable altitude to reach our aim to meet these qualities of generic,…
A weak-field solution of Einstein's equations is constructed. It is generated by a circular cosmic string revolving in its plane about the centre of the circle. (The revolution is introduced to prevent the string from collapsing.) This…
We investigate gravitational properties of thin planar wall solutions of the Einstein's equations in the weak field approximation. We find the general metric solutions and discuss the behavior of a particle placed initially at rest to one…
This paper presents a particle-based optimization method designed for addressing minimization problems with equality constraints, particularly in cases where the loss function exhibits non-differentiability or non-convexity. The proposed…
We propose a new approach to models of general compressible viscous fluids based on the concept of dissipative solutions. These are weak solutions satisfying the underlying equations modulo a defect measure. A dissipative solution coincides…
We obtain an approximate global stationary and axisymmetric solution of Einstein's equations which can be thought as a simple two layers star model: a self-gravitating ball built up by two layers of perfect fluid having different linear…
The Cosmological Constant Problem is re-examined from an effective field theory perspective. While the connection between gravity and particle physics has not been experimentally probed in the quantum regime, it is severely constrained by…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
In the rectilinear Steiner arborescence problem the task is to build a shortest rectilinear Steiner tree connecting a given root and a set of terminals which are placed in the plane such that all root-terminal-paths are shortest paths. This…
In this paper, the stabilized finite element approximation of the Stokes eigenvalue problems is considered for both the two-field (displacement-pressure) and the three-field (stress-displacement-pressure) formulations. The method presented…
Given a set $P$ of $n$ points in $\mathbb{R}^2$ and an input line $\gamma$ in $\mathbb{R}^2$, we present an algorithm that runs in optimal $\Theta(n\log n)$ time and $\Theta(n)$ space to solve a restricted version of the $1$-Steiner tree…
We investigate distributed classical and quantum approaches for the survivable network design problem (SNDP), sometimes called the generalized Steiner problem. These problems generalize many complex graph problems of interest, such as the…
We consider the simplest extension of the standard model, where torsion couples to spinor as well as to scalar fields, and in which the cosmological constant problem is solved.
In the present paper, in order to fnd a singularity of a vector field defined on Riemannian manifolds, we present a new globalization strategy of Newton method and establish its global convergence with superlinear rate. In particular, this…
In this work we consider the generalized Navier-Stoke equations with the presence of a damping term in the momentum equation. % The problem studied here derives from the set of equations which govern the isothermal flow of incompressible,…
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…
In \cite{siebert2019linear} the authors present a set of integer programs (IPs) for the Steiner tree problem, which can be used for both, the directed and the undirected setting of the problem. Each IP finds an optimal Steiner tree with a…
In a recent paper, Gaunt 2020 extended Stein's method to limit distributions that can be represented as a function $g:\mathbb{R}^d\rightarrow\mathbb{R}$ of a centered multivariate normal random vector $\Sigma^{1/2}\mathbf{Z}$ with…
Starting with a general discussion, a program is sketched for a quantization based on dilations. This resolving-power quantization is simplest for scalar field theories. The hope is to find a way to relax the requirement of locality so that…
In this paper, we consider the Uniform Cost-Distance Steiner Tree Problem in metric spaces, a generalization of the well-known Steiner tree problem. Cost-distance Steiner trees minimize the sum of the total length and the weighted path…