相关论文: A Modica-Mortola approximation for the Steiner Pro…
This paper is devoted to classical variational problems for planar elastic curves of clamped endpoints, so-called Euler's elastica problem. We investigate a straightening limit that means enlarging the distance of the endpoints, and obtain…
In the \emph{budgeted rooted node-weighted Steiner tree} problem, we are given a graph $G$ with $n$ nodes, a predefined node $r$, two weights associated to each node modelling costs and prizes. The aim is to find a tree in $G$ rooted at $r$…
We present polylogarithmic approximation algorithms for variants of the Shortest Path, Group Steiner Tree, and Group ATSP problems with vector costs. In these problems, each edge e has a non-negative vector cost $c_e \in…
We study the following two maximization problems related to spanning trees in the Euclidean plane. It is not known whether or not these problems are NP-hard. We present approximation algorithms with better approximation ratios for both…
The geometric bottleneck Steiner network problem on a set of vertices $X$ embedded in a normed plane requires one to construct a graph $G$ spanning $X$ and a variable set of $k\geq 0$ additional points, such that the length of the longest…
In the classical (min-cost) Steiner tree problem, we are given an edge-weighted undirected graph and a set of terminal nodes. The goal is to compute a min-cost tree S which spans all terminals. In this paper we consider the min-power…
The aim of this work is to study the rigidity problem for Steiner's inequality for the anisotropic perimeter, that is, the situation in which the only extremals of the inequality are vertical translations of the Steiner symmetral that we…
The Steiner Tree problem is a classical problem in combinatorial optimization: the goal is to connect a set $T$ of terminals in a graph $G$ by a tree of minimum size. Karpinski and Zelikovsky (1996) studied the $\delta$-dense version of…
In this article, a weak Galerkin method is firstly presented and analyzed for the quasi-linear elliptic problem of non-monotone type. By using Brouwer's fixed point technique, the existence of WG solution and error estimates in both the…
We consider finite energy equivariant solutions for the wave map problem from R2+1 to S2 which are close to the soliton family. We prove asymptotic orbital stability for a codimension two class of initial data which is small with respect to…
We review a new iterative procedure to solve the low-lying states of the Schroedinger equation, done in collaboration with Richard Friedberg. For the groundstate energy, the $n^{th}$ order iterative energy is bounded by a finite limit,…
Recently, W. M. Schmidt and L. Summerer introduced a new theory which allowed them to recover the main known inequalities relating the usual exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and to discover new ones. They…
Coupled-mode systems are used in physical literature to simplify the nonlinear Maxwell and Gross-Pitaevskii equations with a small periodic potential and to approximate localized solutions called gap solitons by analytical expressions…
We adapt Stein's method to isoperimetric and geometric inequalities. The main challenge is the treatment of boundary terms. We address this by using an elliptic PDE with an oblique boundary condition. We apply our geometric formulation of…
In this paper we develop a new approximation method valid for a wide family of nonlinear wave equations of Nonlinear Schr\"odinger type. The result is a reduced set of ordinary differential equations for a finite set of parameters measuring…
We look for three dimensional vortex-solutions, which have finite energy and are stationary solutions, of Klein-Gordon-Maxwell-Proca type systems of equations. We prove the existence of three dimensional cylindrically symmetric…
The Steiner $k$-eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$-subsets of $V (G)$ which contain $v$. In this note, we design a linear algorithm for computing the Steiner $3$-eccentricities and the…
Given a graph G = (V,E) with a root r in V, positive capacities {c(e)|e in E}, and non-negative lengths {l(e)|e in E}, the minimum-length (rooted) edge capacitated Steiner tree problem is to find a tree in G of minimum total length, rooted…
We introduce a new class of Wasserstein-type distances specifically designed to tackle questions concerning stability and convergence to equilibria for kinetic equations. Thanks to these new distances, we improve some classical estimates by…
We provide convergence guarantees for the Deep Ritz Method for abstract variational energies. Our results cover non-linear variational problems such as the $p$-Laplace equation or the Modica-Mortola energy with essential or natural boundary…