Related papers: The Analyst's traveling salesman theorem in graph …
The paper presents an O^*(1.2312^n)-time and polynomial-space algorithm for the traveling salesman problem in an n-vertex graph with maximum degree 3. This improves the previous time bounds of O^*(1.251^n) by Iwama and Nakashima and…
We provide a new upper bound for traveling salesman problem (TSP) in cubic graphs, i.e. graphs with maximum vertex degree three, and prove that the problem for an $n$-vertex graph can be solved in $O(1.2553^n)$ time and in linear space. We…
We study Brenier's variational models for incompressible Euler equations. These models give rise to a relaxation of the Arnold distance in the space of measure-preserving maps and, more generally, measure-preserving plans. We analyze the…
We prove Cheeger inequalities for p-Laplacians on finite and infinite weighted graphs. Unlike in previous works, we do not impose boundedness of the vertex degree, nor do we restrict ourselves to the normalized Laplacian and, more…
We first show that the Traveling Salesman Problem in an n-vertex graph with average degree bounded by d can be solved in O*(2^{(1-\eps_d)n}) time and exponential space for a constant \eps_d depending only on d, where the O*-notation…
In this paper we study spectra of Laplacians of infinite weighted graphs. Instead of the assumption of local finiteness we impose the condition of summability of the weight function. Such graphs correspond to reversible Markov chains with…
For discrete weighted graphs there is sufficient literature about the Cheeger cut and the Cheeger problem, but for metric graphs there are few results about these problems. Our aim is to study the Cheeger cut and the Cheeger problem in…
Laakso's construction is a famous example of an Ahlfors $Q$-regular metric measure space admitting a weak $(1,1)$-Poincar\'{e} inequality that can not be embedded in $\mathbb{R}^n$ for any $n$. The construction is of particular interest…
We introduce a notion of intrinsically H\"older graphs in metric spaces. Following a recent paper of Le Donne and the author, we prove some relevant results as the Ascoli-Arzel\`a compactness Theorem, Ahlfors-David regularity and the…
In the first part Busemann concavity as non-negative curvature is introduced and a bi-Lipschitz splitting theorem is shown. Furthermore, if the Hausdorff measure of a Busemann concave space is non-trivial then the space is doubling and…
In the present paper, we apply Alexandrov geometry methods to study geometric analysis aspects of infinite semiplanar graphs with nonnegative combinatorial curvature in the sense of Higuchi. We obtain the metric classification of these…
Consider~\(n\) nodes~\(\{X_i\}_{1 \leq i \leq n}\) independently distributed in the unit square~\(S,\) each according to a distribution~\(f\) and let~\(K_n\) be the complete graph formed by joining each pair of nodes by a straight line…
We prove a theorem that can be thought of as a common generalization of the Discrete Nodal Theorem and (one direction of) Cheeger's Inequality for graphs. special case of this result will assert that if the second and third eigenvalues of…
A central question in geometric measure theory is whether geometric properties of a set translate into analytical ones. In 1960, E. R. Reifenberg proved that if an $n$-dimensional subset $M$ of $\mathbb{R}^{n+k}$ is well approximated by…
We present a generalization of the inverse mapping theorem, where variations of a weaker non-expansiveness property (referred to as property ${\sf A}$) replace the key $\mathsf{C}^1$ condition. We also obtain inverse mapping theorems that…
We establish sufficient conditions for existence of curves minimizing length as measured with respect to a degenerate metric on the plane while enclosing a specified amount of Euclidean area. Non-existence of minimizers can occur and…
We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…
We investigate the electrochemical processes within an electrolyser cell, which are modelled by a coupled system of second-order quasi-linear elliptic PDEs. In this context, we study an inverse problem aiming to reconstruct both the…
With the aid of the relaxed polygonal inequality (introduced by Fagin et al.) we strive to extend the applicability of Christofides approximation technique to the scope of all complete finite weighted graphs with positive weights. First…
In this paper we construct inverse bijections between two sequences of finite sets. One sequence is defined by planar diagrams and the other by lattice walks. G. Kuperberg has shown that the number of elements in these two sets are equal.…