Related papers: Shortest paths in arbitrary plane domains
We show that for any simple closed curve in the sphere at infinity of a Gromov hyperbolic 3-space with cocompact metric, there exist a properly embedded least area plane in the space spanning the given curve. This gives a positive answer to…
Given an undirected graph $G=(V,E)$ with positive edge lengths and two vertices $s$ and $t$, the next-to-shortest path problem is to find an $st$-path which length is minimum amongst all $st$-paths strictly longer than the shortest path…
In the highway problem, we are given an n-edge line graph (the highway), and a set of paths (the drivers), each one with its own budget. For a given assignment of edge weights (the tolls), the highway owner collects from each driver the…
Let $\gamma:[0,1]\rightarrow \mathbb{S}^{2}$ be a non-degenerate curve in $\mathbb{R}^3$, that is to say, $\det\big(\gamma(\theta),\gamma'(\theta),\gamma"(\theta)\big)\neq 0$. For each $\theta\in[0,1]$, let $V_\theta=\gamma(\theta)^\perp$…
Due to the computational complexity of finding almost shortest simple paths, we propose that identifying a larger collection of (nonbacktracking) paths is more efficient than finding almost shortest simple paths on positively weighted…
Dumas, Foucaud, Perez, and Todinca [SIAM J. Disc. Math., 2024] proved that if the vertex set of a graph $G$ can be covered by $k$ shortest paths, then the pathwidth of $G$ is bounded by $\mathcal{O}(k \cdot 3^k)$. We prove a coarse variant…
Given in the plane a set $S$ of $n$ points and a set of disks centered at these points, the disk graph $G(S)$ induced by these disks has vertex set $S$ and an edge between two vertices if their disks intersect. Note that the disks may have…
Let $A$ be a unital simple separable exact C$^*$-algebra which is approximately divisible and of real rank zero. We prove that the set of positive elements in $A$ with a fixed Cuntz class is path connected. This result applies in particular…
For a given family of smooth closed curves $\gamma^1,...,\gamma^\alpha\subset\mathbb{R}^3$ we consider the problem of finding an elastic \emph{connected} compact surface $M$ with boundary $\gamma=\gamma^1\cup...\cup\gamma^\alpha$. This is…
Paths planned over grids can often be suboptimal in an Euclidean space and contain a large number of unnecessary turns. Consequently, researchers have looked into post-processing techniques to improve the paths after they are planned. In…
The main purpose of this paper is to study the length minimizing property of Hamiltonian paths on closed symplectic manifolds $(M,\omega)$ such that there are no spherical homology class $A \in H_2(M)$ with $$ \omega(A) > 0 \quad \text{and}…
A problem studied in Systems Biology is how to find shortest paths in metabolic networks. Unfortunately, simple (i.e., graph theoretic) shortest paths do not properly reflect biochemical facts. An approach to overcome this issue is to use…
A hypergraph $H$ is hamiltonian-connected if for any distinct vertices $x$ and $y$, $H$ contains a hamiltonian Berge path from $x$ to $y$. We find for all $3\leq r<n$, exact lower bounds on minimum degree $\delta(n,r)$ of an $n$-vertex…
The hereditary discrepancy of a set system is a certain quantitative measure of the pseudorandom properties of the system. Roughly, hereditary discrepancy measures how well one can $2$-color the elements of the system so that each set…
For every $n\in\mathbb N$ we construct a finite graph $G$ such that every orientation $\vec G$ of $G$ contains an isometric copy of any oriented tree on $n$ vertices, and evaluate the smallest possible cardinality of $G$. On the other hand,…
Computing a shortest path between two nodes in an undirected unweighted graph is among the most basic algorithmic tasks. Breadth first search solves this problem in linear time, which is clearly also a lower bound in the worst case.…
We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the…
We consider the problem of finding ``dissimilar'' $k$ shortest paths from $s$ to $t$ in an edge-weighted directed graph $D$, where the dissimilarity is measured by the minimum pairwise Hamming distances between these paths. More formally,…
We present a new preprocessing algorithm for embedding the nodes of a given edge-weighted undirected graph into a Euclidean space. The Euclidean distance between any two nodes in this space approximates the length of the shortest path…
The \textit{longest path transversal number} of a connected graph $G$, denoted by $lpt(G)$, is the minimum size of a set of vertices of $G$ that intersects all longest paths in $G$. We present constant upper bounds for the longest path…