相关论文: One-dimensional Gromov minimal filling

We study a variational problem on a smooth manifold with a decomposition of the tangent bundle into $k>2$ subbundles (distributions), namely, we consider the integrated sum of their mixed scalar curvatures as a functional of adapted…

In this paper, several nonlinear elliptic systems are investigated on graphs. One type of the sobolev embedding theorem and a new version of the strong maximum principle are established. Then, by using the variational method, the existence…

The submodular partitioning problem asks to minimize, over all partitions $P$ of a ground set $V$, the sum of a given submodular function $f$ over the parts of $P$. The problem has seen considerable work in approximability, as it…

We consider discretization of the 'geometric cover problem' in the plane: Given a set $P$ of $n$ points in the plane and a compact planar object $T_0$, find a minimum cardinality collection of planar translates of $T_0$ such that the union…

The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…

We present problems and results that combine graph-minors and coarse geometry. For example, we ask whether every geodesic metric space (or graph) without a fat $H$ minor is quasi-isometric to a graph with no $H$ minor, for an arbitrary…

In the $0$-Extension problem, we are given an edge-weighted graph $G=(V,E,c)$, a set $T\subseteq V$ of its vertices called terminals, and a semi-metric $D$ over $T$, and the goal is to find an assignment $f$ of each non-terminal vertex to a…

The limited connectivity of current and next-generation quantum annealers motivates the need for efficient graph-minor embedding methods. These methods allow non-native problems to be adapted to the target annealer's architecture. The…

Given a graph $G = (V,E)$ and a subset $T \subseteq V$ of terminals, a \emph{Steiner tree} of $G$ is a tree that spans $T$. In the vertex-weighted Steiner tree (VST) problem, each vertex is assigned a non-negative weight, and the goal is to…

This article presents a novel resolution to the problem of spline interpolation versus least-squares fitting on smooth Riemannian manifolds utilizing the method of gradient flows of networks. This approach represents a contribution to both…

We propose a new approach to studies on partial Steiner triple systems consisting in determining complete graphs contained in them. We establish the structure which complete graphs yield in a minimal PSTS that contains them. As a by-product…

In this paper a new graph invariant based on the minimal hitting set problem is introduced. It is shown that it represents a tight lower bound for the doubly metric dimension of a graph. Exact values of new invariant for paths, stars,…

Given a graph where vertices are partitioned into $k$ terminals and non-terminals, the goal is to compress the graph (i.e., reduce the number of non-terminals) using minor operations while preserving terminal distances approximately.The…

We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to be removed from the graph to destroy all cycles). These…

The goal of this work is to establish a proof of the Gromov convergence in Hoelder spaces for curves with a totally real boundary condition following the original geometric idea of Gromov. We use a local reflection principle in…

In this note we give an answer to a question about mixed volumes asked by Gromov in his paper "Convex Sets and Kahler Manifolds". For reader's convenience we remind definitions and some of the properties of mixed volumes and mixed…

For $N$ compatible substitution rules on $M$ prototiles $t_1,\dots,t_M$, consider tilings and tiling spaces constructed by applying the different substitution rules at random. These give (globally) random substitution tilings. In this paper…

We introduce a new approach to spectral sparsification that approximates the quadratic form of the pseudoinverse of a graph Laplacian restricted to a subspace. We show that sparsifiers with a near-linear number of edges in the dimension of…

We study a generalization of the Steiner tree problem, where we are given a weighted network $G$ together with a collection of $k$ subsets of its vertices and a root $r$. We wish to construct a minimum cost network such that the network…

To integer programming problems, computational algebraic approaches using Grobner bases or standard pairs via the discreteness of toric ideals have been studied in recent years. Although these approaches have not given improved time…