相关论文: A Modica-Mortola approximation for the Steiner Pro…
We obtain an approximate global stationary and axisymmetric solution of Einstein's equations which can be thought as a simple two layers star model: a self-gravitating ball built up by two layers of perfect fluid having different linear…
This paper deals with the systematic development of structure-preserving approximations for a class of nonlinear partial differential equations on networks. The class includes, for example, gas pipe network systems described by barotropic…
The \emph{Steiner tree} problem is one of the fundamental and classical problems in combinatorial optimization. In this paper, we study this problem in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$ model of distributed computing and present…
In the Directed Steiner Tree (DST) problem we are given an $n$-vertex directed edge-weighted graph, a root $r$, and a collection of $k$ terminal nodes. Our goal is to find a minimum-cost arborescence that contains a directed path from $r$…
This paper explores the problem of analytically approximating the orbital state for a subset of orbits in a rotating potential with oblateness and ellipticity perturbations. This is done by isolating approximate differential equations for…
This paper is devoted to the analysis of a numerical scheme based on the Finite Element Method for approximating the solution of Koiter's model for a linearly elastic elliptic membrane shell subjected to remaining confined in a prescribed…
A new family of exact solutions of the Einstein-Maxwell equations for static axially symmetric spacetimes is presented. The metric functions of the solutions are explicitely computed and are simply written in terms of the oblate spheroidal…
This paper is devoted to the convergence and optimality analysis of the adaptive Morley element method for the fourth order elliptic problem. A new technique is developed to establish a quasi-orthogonality which is crucial for the…
This paper is concerned with the derivation of computable and guaranteed upper and lower bounds of the difference between the exact and the approximate solution of a boundary value problem for static Maxwell equations. Our analysis is based…
We establish some new results about the $\Gamma$-limit, with respect to the $L^1$-topology, of two different (but related) phase-field approximations of the so-called Euler's Elastica Bending Energy for curves in the plane.
In the $k$-connected directed Steiner tree problem ($k$-DST), we are given an $n$-vertex directed graph $G=(V,E)$ with edge costs, a connectivity requirement $k$, a root $r\in V$ and a set of terminals $T\subseteq V$. The goal is to find a…
Prize-Collecting Steiner Tree (PCST) is a generalization of the Steiner Tree problem, a fundamental problem in computer science. In the classic Steiner Tree problem, we aim to connect a set of vertices known as terminals using the…
The hop-constrained Steiner tree problem (HSTP) is a generalization of the classical Steiner tree problem. It asks for a minimum cost subtree that spans some specified nodes of a given graph, such that the number of edges between each node…
We are concerned with the well-posedness of linear elliptic systems posed on $\mathbb{R}^d$. The concrete problem of interest, for which we require this theory, arises from the linearization of the equations of anisotropic finite…
A modified version of the Moller-Plesset approach for obtaining the correlation energy associated to a Hartree-Fock ground state is proposed. The method is tested in a model of interacting fermions that allows for an exact solution. Using…
We consider the problem of minimizing Euler's elastica energy for simple closed curves confined to the unit disk. We approximate a simple closed curve by the zero level set of a function with values +1 on the inside and -1 on the outside of…
In this article we investigate a finite element formulation of strongly monotone quasi-linear elliptic PDEs in the context of fixed-point iterations. As opposed to Newton's method, which requires information from the previous iteration in…
We study the problem of finding a minimum weight connected subgraph spanning at least $k$ vertices on planar, node-weighted graphs. We give a $(4+\eps)$-approximation algorithm for this problem. We achieve this by utilizing the recent LMP…
In this work, I collect and discuss a series of open questions in one-dimensional geometric optimization in Euclidean spaces. The focus is on two classes of problems: maximal distance minimizers and Steiner trees. Maximal distance…
We apply the Asymptotic Iteration Method to obtain the bound-state energy spectrum for the d-dimensional Klein-Gordon equation with scalar S(r) and vector potentials V(r). When S(r) and V(r) are both Coulombic, we obtain all the exact…