Related papers: On the Steiner tree connecting a fractal set

Given a graph $G$ with a terminal set $R \subseteq V(G)$, the Steiner tree problem (STREE) asks for a set $S\subseteq V(G) \setminus R$ such that the graph induced on $S\cup R$ is connected. A split graph is a graph which can be partitioned…

We discussed hierarchies and rescaling rule of the self similar transformations in Ising models, and define a fractal dimension of an ordered cluster, which minimum corresponds to a fixed point of the transformations. By the fractal…

We show that the singular set $\Sigma$ in the classical obstacle problem can be locally covered by a $C^\infty$ hypersurface, up to an "exceptional" set $E$, which has Hausdorff dimension at most $n-2$ (countable, in the $n=2$ case).…

In this paper we consider determining a minimal surface embedded in a Riemannian manifold $\Sigma\times \mathbb{R}$. We show that if $\Sigma$ is a two dimensional Riemannian manifold with boundary, then the knowledge of the associated…

We consider a new Steiner tree problem, called vertex-cover-weighted Steiner tree problem. This problem defines the weight of a Steiner tree as the minimum weight of vertex covers in the tree, and seeks a minimum-weight Steiner tree in a…

We prove a fix point theorem for monoids of self-embeddings of trees. As a corollary, we obtain a result by Laflamme, Pouzet and Sauer that a tree either contains a subdivided binary tree as a subtree or has a vertex, and edge, an end or…

In this paper we study a wide class of planar single-trace four point correlators in the chiral conformal field theory ($\chi$CFT$_4$) arising as a double scaling limit of the $\gamma$-deformed $\mathcal{N}=4$ SYM theory. In the planar…

We introduce a graph partitioning problem motivated by computational topology and propose two algorithms that produce approximate solutions. Specifically, given a weighted, undirected graph $G$ and a positive integer $k$, we desire to find…

In this paper, we establish the theory of $p$-modulus of a family of infinite paths on an infinite-rooted tree and then explore its interpretation and properties. One key result is the formulation of $p$-modulus on the infinite tree as a…

Finding the set of leaves for an unbounded tree is a nontrivial process in both the Weihrauch and reverse mathematics settings. Despite this, many combinatorial principles for trees are equivalent to their restrictions to trees with leaf…

In length-constrained minimum spanning tree (MST) we are given an $n$-node graph $G = (V,E)$ with edge weights $w : E \to \mathbb{Z}_{\geq 0}$ and edge lengths $l: E \to \mathbb{Z}_{\geq 0}$ along with a root node $r \in V$ and a…

The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph G=(V,E), a set of terminals R, and non-negative costs c_e for…

Tree rotations (left and right) are basic local deformations allowing to transform between two unlabeled binary trees of the same size. Hence, there is a natural problem of practically finding such transformation path with low number of…

Given a directed graph $G$ and a list $(s_1,t_1),\dots,(s_d,t_d)$ of terminal pairs, the Directed Steiner Network problem asks for a minimum-cost subgraph of $G$ that contains a directed $s_i\to t_i$ path for every $1\le i \le k$. The…

An elimination tree for a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $x$ and recursing on the connected components of $G-x$ to produce the subtrees of $x$. Elimination trees appear in many guises…

The Minimum Weight Steiner Tree (MST) is an important combinatorial optimization problem over networks that has applications in a wide range of fields. Here we discuss a general technique to translate the imposed global connectivity…

Given a set $P$ of terminals in the plane and a partition of $P$ into $k$ subsets $P_1, ..., P_k$, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree $T_i$ connecting the terminals in each set $P_i$ ($i=1,...,k$)…

In this article a collection of random self-similar fractal dendrites is constructed, and their Hausdorff dimension is calculated. Previous results determining this quantity for random self-similar structures have relied on geometrical…

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

We say that a tree $T$ is an $S$-Steiner tree if $S \subseteq V(T)$ and a hypergraph is an $S$-Steiner hypertree if it can be trimmed to an $S$-Steiner tree. We prove that it is NP-complete to decide, given a hypergraph $\mathcal{H}$ and…