Related papers: Shortest paths in arbitrary plane domains

Let M be an orientable hyperbolic surface without boundary and let $\gamma$ be a closed geodesic in M. We prove that any side of any triangle formed by distinct lifts of $\gamma$ in H2 is shorter than $\gamma$.

For non-homotopic maps $u,v\in C^{\infty}(M,N)$ between closed Riemannian manifolds, we consider the smallest energy level $\gamma_p(u,v)$ for which there exist paths $u_t\in W^{1,p}(M,N)$ connecting $u_0=u$ to $u_1=v$ with…

Let S be a set of distinct points in general position in the Euclidean plane. A plane Hamiltonian path on S is a crossing-free geometric path such that every point of S is a vertex of the path. It is known that, if S is sufficiently large,…

Let $X$ be a finite CW complex and let $h_1, h_2: C(X)\to A$ be two unital \hm s, where $A$ is a unital C*-algebra. We study the problem when $h_1$ and $h_2$ are approximately homotopic. We present a $K$-theoretical necessary and sufficient…

We consider a constrained version of the shortest path problem on the complete graphs whose edges have independent random lengths and costs. We establish the asymptotic value of the minimum length as a function of the cost-budget within a…

The shortest path problem is related to many dynamic processes on networks, ranging from routing in communication networks to signaling in molecular interaction networks. When the network is fully known, the shortest path problem can be…

It is shown that a minimum weight spanning tree of a finite ultrametric space can be always found in the form of path. As a canonical representing tree such path uniquely defines the whole space and, moreover, it has much more simple…

In this work, we propose a novel and efficient method for smoothing polylines in motion planning tasks. The algorithm applies to motion planning of vehicles with bounded curvature. In the paper, we show that the generated path: 1) has…

We study planar domains $G$ equipped with a hyperbolic type metric and approximate geodesics that join two points $x,y \in G$ and their lengths. We present an algorithm that enables one to approximate the shortest distance in polygonal…

We present parallel algorithms for computing single-source reachability and shortest paths on directed $n$-vertex $m$-edge graphs using near-linear $\tilde{O}(m)$ work and $o(\sqrt{n})$ depth whenever $m\ge n^{1+o(1)}$. At the extreme of…

We prove the existence and uniqueness of harmonic maps in degree one homotopy classes of closed, orientable surfaces of positive genus, when the target has conic points with cone angles less than $2\pi$. For a cone point $p$ of cone angle…

We study shortest curves in proximally smooth subsets of a Hilbert space. We consider an $R$-proximally smooth set $A$ in a Hilbert space with points $a$ and $b$ satisfying $\left|{a-b}\right| < 2R.$ We provide a simple geometric algorithm…

A covering path for a finite set $P$ of points in the plane is a polygonal path such that every point of $P$ lies on a segment of the path. The vertices of the path need not be at points of $P$. A covering path is plane if its segments do…

For an n-vertex directed graph $G = (V,E)$, a $\beta$-\emph{shortcut set} $H$ is a set of additional edges $H \subseteq V \times V$ such that $G \cup H$ has the same transitive closure as $G$, and for every pair $u,v \in V$, there is a…

In the Disjoint Shortest Paths problem one is given a graph $G$ and a set $\mathcal{T}=\{(s_1,t_1),\dots,(s_k,t_k)\}$ of $k$ vertex pairs. The question is whether there exist vertex-disjoint paths $P_1,\dots,P_k$ in $G$ so that each $P_i$…

The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized. We derive several semidefinite programming relaxations for the…

Let $G=(V,E)$ be any undirected graph on $V$ vertices and $E$ edges. A path $\textbf{P}$ between any two vertices $u,v\in V$ is said to be $t$-approximate shortest path if its length is at most $t$ times the length of the shortest path…

Computing approximate shortest paths in the dynamic streaming setting is a fundamental challenge that has been intensively studied during the last decade. Currently existing solutions for this problem either build a sparse multiplicative…

We investigate the Minimum Eccentricity Shortest Path problem in some structured graph classes. It asks for a given graph to find a shortest path with minimum eccentricity. Although it is NP-hard in general graphs, we demonstrate that a…

In the vector-field guided path-following problem, a sufficiently smooth vector field is designed such that its integral curves converge to and move along a one-dimensional geometric desired path. The existence of singular points where the…