Related papers: Branching points in the planar Gilbert--Steiner pr…
The optimal mass transport problem gives a geometric framework for optimal allocation, and has recently gained significant interest in application areas such as signal processing, image processing, and computer vision. Even though it can be…
The Steiner tree problem is a well-known problem in network design, routing, and VLSI design. Given a graph, edge costs, and a set of dedicated vertices (terminals), the Steiner tree problem asks to output a sub-graph that connects all…
Given the coordinates of four terminals in the Euclidean plane we present explicit formulas for Steiner point coordinates for Steiner minimal tree problem. We utilize the obtained formulas for evaluation of the influence of terminal…
The present paper opens a new branch in the theory of variational problems with branching extremals, the investigation of one-dimensional minimal fillings of finite pseudo-metric spaces. On the one hand, this problem is a one-dimensional…
An optimal transport problem on finite spaces is a linear program. Recently, a relaxation of the optimal transport problem via strictly convex functions, especially via the Kullback--Leibler divergence, sheds new light on data sciences.…
Let $\mathcal G$ be a separable family of graphs. Then for all positive constants $\epsilon$ and $\Delta$ and for every sufficiently large integer $n$, every sequence $G_1,\dotsc,G_t\in\mathcal G$ of graphs of order $n$ and maximum degree…
The cost-distance Steiner tree problem seeks a Steiner tree that minimizes the total congestion cost plus the weighted sum of source-sink delays. This problem arises as a subroutine in timing-constrained global routing with a linear delay…
Given a graph $G$, the general position problem is to find a largest set $S$ of vertices of $G$ such that no three vertices of $S$ lie on a common geodesic. Such a set is called a ${\rm gp}$-$set$ of $G$ and its cardinality is the ${\rm…
We design a 3/2 approximation algorithm for the Generalized Steiner Tree problem (GST) in metrics with distances 1 and 2. This is the first polynomial time approximation algorithm for a wide class of non-geometric metric GST instances with…
We consider multi-dimensional assignment problems in a probabilistic setting. Our main results are: (i) A new efficient algorithm for the 3-dimensional planar problem, based on enumerating and selecting from a set of "alternating-path…
A random planar quadrangulation process is introduced as an approximation for certain cellular automata in terms of random growth of rays from a given set of points. This model turns out to be a particular (rectangular) case of the…
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, we show how to build a Steiner forest spanner for such graphs.…
We prove that optimal traffic plans for the mailing problem in $\mathbb{R}^d$ are stable with respect to variations of the given coupling, above the critical exponent $\alpha=1-1/d$, thus solving an open problem stated in the book "Optimal…
Spanning tree problems with specialized constraints can be difficult to solve in real-world scenarios, often requiring intricate algorithmic design and exponential time. Recently, there has been growing interest in end-to-end deep neural…
We consider the two dimensional BV least gradient problem on an annulus with given boundary data $g \in BV(\partial\Omega)$. Firstly, we prove that this problem is equivalent to the optimal transport problem with source and target measures…
We consider the fundamental problem of sampling the optimal transport coupling between given source and target distributions. In certain cases, the optimal transport plan takes the form of a one-to-one mapping from the source support to the…
We generalized the Steiner's shortest line problem and found its connection with the concepts in classical field theory. We solved the generalized Steiner's problem by introducing a conservative potential and a dissipative force in the…
We present a general method for obtaining strong bounds for discrete optimization problems that is based on a concept of branching duality. It can be applied when no useful integer programming model is available, and we illustrate this with…
Given a spanning tree $T$ of a planar graph $G$, the co-tree of $T$ is the spanning tree of the dual graph $G^*$ with edge set $(E(G)-E(T))^*$. Gr\"unbaum conjectured in 1970 that every planar 3-connected graph $G$ contains a spanning tree…
The Steiner tree problem is one of the most prominent problems in network design. Given an edge-weighted undirected graph and a subset of the vertices, called terminals, the task is to compute a minimum-weight tree containing all terminals…