中文
相关论文

相关论文: A Modica-Mortola approximation for the Steiner Pro…

200 篇论文

We design a 3/2 approximation algorithm for the Generalized Steiner Tree problem (GST) in metrics with distances 1 and 2. This is the first polynomial time approximation algorithm for a wide class of non-geometric metric GST instances with…

计算复杂性 · 计算机科学 2008-12-12 Piotr Berman , Marek Karpinski , Alex Zelikovsky

We study elliptic families of solutions to the recently introduced constrained Toda hierarchy, i.e., solutions which are elliptic functions of some linear combination of the hierarchical times. Equations of motion for poles of such…

可精确求解与可积系统 · 物理学 2022-11-09 A. Zabrodin

Bottleneck Steiner networks model energy consumption in wireless ad-hoc networks. The task is to design a network spanning a given set of terminals and at most $k$ Steiner points such that the length of the longest edge is minimised. The…

组合数学 · 数学 2019-07-09 M Brazil , C Ras , D Thomas , G Xu

We give a 1.25 approximation algorithm for the Steiner Tree Problem with distances one and two, improving on the best known bound for that problem.

计算复杂性 · 计算机科学 2008-10-13 Piotr Berman , Marek Karpinski , Alex Zelikovsky

We consider a new Steiner tree problem, called vertex-cover-weighted Steiner tree problem. This problem defines the weight of a Steiner tree as the minimum weight of vertex covers in the tree, and seeks a minimum-weight Steiner tree in a…

数据结构与算法 · 计算机科学 2018-08-08 Takuro Fukunaga , Takanori Maehara

For a metric graph $G=(V,E)$ and $R\subset V$, the internal Steiner minimum tree problem asks for a minimum weight Steiner tree spanning $R$ such that every vertex in $R$ is not a leaf. This note shows a simple polynomial-time…

数据结构与算法 · 计算机科学 2013-07-18 Bang Ye Wu

The classical Monge-Kantorovich (MK) problem as originally posed is concerned with how best to move a pile of soil or rubble to an excavation or fill with the least amount of work relative to some cost function. When the cost is given by…

泛函分析 · 数学 2017-10-31 Yongxin Chen , Wilfrid Gangbo , Tryphon T. Georgiou , Allen Tannenbaum

In this paper we propose a modified Lie-type spectral splitting approximation where the external potential is of quadratic type. It is proved that we can approximate the solution to a one-dimensional nonlinear Schroedinger equation by…

数学物理 · 物理学 2022-03-17 Andrea Sacchetti

A periodic connection is constructed for a double well potential defined in the plane. This solution violates Modica's estimate as well as the corresponding Liouville Theorem for general phase transition potentials. Gradient estimates are…

偏微分方程分析 · 数学 2014-11-19 Panayotis Smyrnelis

Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is intended for signal transmission, e.g. in chip design or…

数据结构与算法 · 计算机科学 2025-07-31 Josefine Foos , Stephan Held , Yannik Kyle Dustin Spitzley

We analyze a new general representation for the Minimum Weight Steiner Tree (MST) problem which translates the topological connectivity constraint into a set of local conditions which can be analyzed by the so called cavity equations…

统计力学 · 物理学 2009-01-14 M. Bayati , A. Braunstein , R. Zecchina

We study elliptic solutions of the recently introduced Toda lattice with the constraint of type B and derive equations of motion for their poles. The dynamics of poles is given by the deformed Ruijsenaars-Schneider system. We find its…

可精确求解与可积系统 · 物理学 2023-08-16 V. Prokofev , A. Zabrodin

By introducing a new topology, a representation formula of the Gamma limit of the Kobayashi-Warren-Carter energy is given in a multi-dimensional domain. A key step is to study the Gamma limit of a single-well Modica-Mortola functional. The…

偏微分方程分析 · 数学 2022-05-31 Yoshikazu Giga , Jun Okamoto , Koya Sakakibara , Masaaki Uesaka

The Steiner tree problem is one of the classic and most fundamental $\mathcal{NP}$-hard problems: given an arbitrary weighted graph, seek a minimum-cost tree spanning a given subset of the vertices (terminals). Byrka \emph{et al}. proposed…

数据结构与算法 · 计算机科学 2018-11-02 Chi-Yeh Chen

We discuss a new approach to solve the low lying states of the Schroedinger equation. For a fairly large class of problems, this new approach leads to convergent iterative solutions, in contrast to perturbative series expansions. These…

量子物理 · 物理学 2009-11-10 R. Friedberg , T. D. Lee

We propose an approximate solution of the time-dependent Schr\"odinger equation using the method of stationary states combined with a variational matrix method for finding the energies and eigenstates. We illustrate the effectiveness of the…

量子物理 · 物理学 2009-11-11 Paolo Amore , Alfredo Aranda , Francisco M. Fernandez , Hugh Jones

In the Euclidean Bottleneck Steiner Tree problem, the input consists of a set of $n$ points in $\mathbb{R}^2$ called terminals and a parameter $k$, and the goal is to compute a Steiner tree that spans all the terminals and contains at most…

计算几何 · 计算机科学 2023-12-05 Sayan Bandyapadhyay , William Lochet , Daniel Lokshtanov , Saket Saurabh , Jie Xue

This paper studies the problem of computing a linear approximation of quadratic Wasserstein distance $W_2$. In particular, we compute an approximation of the negative homogeneous weighted Sobolev norm whose connection to Wasserstein…

数值分析 · 数学 2022-03-02 Philip Greengard , Jeremy G. Hoskins , Nicholas F. Marshall , Amit Singer

In this paper we consider the branched transportation problem in 2D associated with a cost per unit length of the form $1 + \alpha m$ where $m$ denotes the amount of transported mass and $\alpha > 0$ is a fixed parameter (notice that the…

偏微分方程分析 · 数学 2016-09-05 A. Chambolle , B. Merlet , L. Ferrari

We use a finite element approach based on Galerkin method to obtain approximate steady state solutions of the thermistor problem with temperature dependent electrical conductivity.

偏微分方程分析 · 数学 2007-11-06 Moulay Rchid Sidi Ammi , Delfim F. M. Torres