Related papers: An oscillatory Fermat-Torricelli tree in R^2
Piecewise divergence-free nonconforming virtual elements are designed for Stokes problem in any dimensions. After introducing a local energy projector based on the Stokes problem and the stabilization, a divergence-free nonconforming…
We present an approximation algorithm for Weighted Tree Augmentation with approximation factor $1+\ln 2 + \varepsilon < 1.7$. This is the first algorithm beating the longstanding factor of $2$, which can be achieved through many standard…
An approximate Steiner tree is a Steiner tree on a given set of terminals in Euclidean space such that the angles at the Steiner points are within a specified error e from 120 degrees.This notion arises in numerical approximations of…
Our principal aim is to illustrate that the concept Birkhoff-James orthogonality can be applied effectively to obtain a unified approach to a large family of optimization problems in Banach spaces. We study such optimization problems from…
We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…
There are many classical problems in P whose time complexities have not been improved over the past decades. Recent studies of "Hardness in P" have revealed that, for several of such problems, the current fastest algorithm is the best…
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…
A set of equations is developed to describe a curve in space given the curvature $\kappa$ and the angle of rotation $\theta$ of the osculating plane. The set of equations has a solution (in terms of $\kappa$ and $\theta$) that indirectly…
In this paper we present a new solution of the star-triangle relation having positive Boltzmann weights. The solution defines an exactly solvable two-dimensional Ising-type (edge interaction) model of statistical mechanics where the local…
R-trees can be used to store and query sets of point data in two or more dimensions. An easy way to construct and maintain R-trees for two-dimensional points, due to Kamel and Faloutsos, is to keep the points in the order in which they…
We study the cosmology of a quadratic metric-compatible torsionful gravity theory in the presence of a perfect hyperfluid. The gravitational action is an extension of the Einstein-Cartan theory given by the usual Einstein-Hilbert…
In this paper we consider the branched transportation problem in 2D associated with a cost per unit length of the form $1 + \alpha m$ where $m$ denotes the amount of transported mass and $\alpha > 0$ is a fixed parameter (notice that the…
The Fermat-Weber location problem requires finding a point in $\mathbb{R}^n$ that minimizes the sum of weighted Euclidean distances to $m$ given points. An iterative solution method for this problem was first introduced by E. Weiszfeld in…
It is known that for every $\alpha \geq 1$ there is a planar triangulation in which every ball of radius $r$ has size $\Theta(r^\alpha)$. We prove that for $\alpha <2$ every such triangulation is quasi-isometric to a tree. The result…
Courcelle's Theorem states that every problem definable in Monadic Second-Order logic can be solved in linear time on structures of bounded treewidth, for example, by constructing a tree automaton that recognizes or rejects a tree…
Given two sets of points in the plane, $P$ of $n$ terminals and $S$ of $m$ Steiner points, a Steiner tree of $P$ is a tree spanning all points of $P$ and some (or none or all) points of $S$. A Steiner tree with length of longest edge…
In a complete graph $K_n$ with edge weights drawn independently from a uniform distribution $U(0,1)$ (or alternatively an exponential distribution $\operatorname{Exp}(1)$), let $T_1$ be the MST (the spanning tree of minimum weight) and let…
In the Euclidean Bottleneck Steiner Tree problem, the input consists of a set of $n$ points in $\mathbb{R}^2$ called terminals and a parameter $k$, and the goal is to compute a Steiner tree that spans all the terminals and contains at most…
We present subquadratic algorithms in the algebraic decision-tree model for several \textsc{3Sum}-hard geometric problems, all of which can be reduced to the following question: Given two sets $A$, $B$, each consisting of $n$ pairwise…
Motivated by the need for the rigorous analysis of the numerical stability of variational least-squares kernel-based methods for solving second-order elliptic partial differential equations, we provide previously lacking stability…