English
Related papers

Related papers: On Euclidean Steiner $(1+\epsilon)$-Spanners

200 papers

Ahmed, Bodwin, Sahneh, Kobourov, and Spence (WG 2020) introduced additive spanners for weighted graphs and constructed (i) a $+2W_{\max}$ spanner with $O(n^{3/2})$ edges and (ii) a $+4W_{\max}$ spanner with $\tilde{O}(n^{7/5})$ edges, and…

Data Structures and Algorithms · Computer Science 2024-08-28 An La , Hung Le

We study static, spherically symmetric, self-gravitating systems minimally coupled to a scalar field with U(1) gauge symmetry: charged boson stars. We find numerical solutions to the EinsteinMaxwell equations coupled to the relativistic…

High Energy Astrophysical Phenomena · Physics 2013-08-05 Daniela Pugliese , Hernando Quevedo , Jorge A. Rueda H. , Remo Ruffini

Soft cosmology is an extension of standard cosmology allowing for a scale-dependent equation-of-state (EoS) parameter in the dark sectors, which is one of the properties of soft materials in condensed-matter physics, that may arise either…

Cosmology and Nongalactic Astrophysics · Physics 2022-12-12 Emmanuel N. Saridakis , Weiqiang Yang , Supriya Pan , Fotios K. Anagnostopoulos , Spyros Basilakos

Let $G$ be an unweighted, undirected graph. An additive $k$-spanner of $G$ is a subgraph $H$ that approximates all distances between pairs of nodes up to an additive error of $+k$, that is, it satisfies $d_H(u,v) \le d_G(u,v)+k$ for all…

Data Structures and Algorithms · Computer Science 2017-04-17 Mathias Bæk Tejs Knudsen

For the unit sphere S^d in Euclidean space R^(d+1), we show that for d-1<s<d and any N>1, discrete N-point minimal Riesz s-energy configurations are well separated in the sense that the minimal distance between any pair of distinct points…

Mathematical Physics · Physics 2007-05-23 A. B. J. Kuijlaars , E. B. Saff , X. Sun

In this paper we consider the problem of efficiently constructing $k$-vertex fault-tolerant geometric $t$-spanners in $\dspace$ (for $k \ge 0$ and $t >1$). Vertex fault-tolerant spanners were introduced by Levcopoulus et. al in 1998. For…

Computational Geometry · Computer Science 2013-03-29 Sanjiv Kapoor , XiangYang Li

We study the min-max optimization problem where each function contributing to the max operation is strongly-convex and smooth with bounded gradient in the search domain. By smoothing the max operator, we show the ability to achieve an…

Optimization and Control · Mathematics 2019-05-31 Hakan Gokcesu , Kaan Gokcesu , Suleyman Serdar Kozat

For any constant $d$ and parameter $\varepsilon > 0$, we show the existence of (roughly) $1/\varepsilon^d$ orderings on the unit cube $[0,1)^d$, such that any two points $p,q\in [0,1)^d$ that are close together under the Euclidean metric…

Computational Geometry · Computer Science 2020-04-16 Timothy M. Chan , Sariel Har-Peled , Mitchell Jones

We investigate how the complexity of Euclidean TSP for point sets $P$ inside the strip $(-\infty,+\infty)\times [0,\delta]$ depends on the strip width $\delta$. We obtain two main results. First, for the case where the points have distinct…

Computational Geometry · Computer Science 2024-04-08 Henk Alkema , Mark de Berg , Remco van der Hofstad , Sándor Kisfaludi-Bak

Let $\Phi\in\mathbb{R}^{m\times n}$ be a sparse Johnson-Lindenstrauss transform [KN14] with $s$ non-zeroes per column. For a subset $T$ of the unit sphere, $\varepsilon\in(0,1/2)$ given, we study settings for $m,s$ required to ensure $$…

Data Structures and Algorithms · Computer Science 2015-08-27 Jean Bourgain , Sjoerd Dirksen , Jelani Nelson

I review briefly, primarily for relativists, a series of recent results, obtained with A. Waldron, on the novel behavior of massive higher (s>1) spin systems in constant curvature backgrounds. We find that the cosmological constant Lambda,…

General Relativity and Quantum Cosmology · Physics 2008-11-26 S. Deser

Given a graph $G = (V,E)$, a subgraph $H$ is an \emph{additive $+\beta$ spanner} if $\dist_H(u,v) \le \dist_G(u,v) + \beta$ for all $u, v \in V$. A \emph{pairwise spanner} is a spanner for which the above inequality only must hold for…

Discrete Mathematics · Computer Science 2021-03-31 Reyan Ahmed , Greg Bodwin , Faryad Darabi Sahneh , Keaton Hamm , Stephen Kobourov , Richard Spence

We place limits on scalar and vector unparticle couplings to electrons and neutrinos using data from reactor neutrino experiments originally designed to search for neutrino magnetic moment. Upper bounds on Standard Model lepton-scalar…

High Energy Physics - Phenomenology · Physics 2008-11-26 A. B. Balantekin , K. O. Ozansoy

Let $A$ be an $n\times n$ real matrix, and let $M$ be an $n\times n$ random matrix whose entries are i.i.d sub-Gaussian random variables with mean $0$ and variance $1$. We make two contributions to the study of $s_n(A+M)$, the smallest…

Probability · Mathematics 2020-09-04 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

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…

Computational Geometry · Computer Science 2020-10-09 Ahmad Biniaz

For a weighted graph $G = (V, E, w)$ and a designated source vertex $s \in V$, a spanning tree that simultaneously approximates a shortest-path tree w.r.t. source $s$ and a minimum spanning tree is called a shallow-light tree (SLT).…

Computational Geometry · Computer Science 2025-12-12 Hung Le , Shay Solomon , Cuong Than , Csaba D. Tóth , Tianyi Zhang

Fault-tolerant spanners are fundamental objects that preserve distances in graphs even under edge failures. A long line of work culminating in Bodwin, Dinitz, Robelle (SODA 2022) gives $(2k-1)$-stretch, $f$-fault-tolerant spanners with…

Data Structures and Algorithms · Computer Science 2026-03-26 Sanjeev Khanna , Christian Konrad , Aaron Putterman

Let $\mathcal{P}$ be a set of $n$ points in the Euclidean plane. We prove that, for any $\epsilon > 0$, either a single line or circle contains $n/2$ points of $\mathcal{P}$, or the number of distinct perpendicular bisectors determined by…

Combinatorics · Mathematics 2019-03-06 Ben Lund

We introduce a minimal Dark Standard Model (DSM) consisting of a single spin-0 particle with dark $U(1)$ gauge symmetry, and completely decoupled from the visible sector. Characterized only by the scalar mass $\mu$ and the dark charge $q$,…

High Energy Physics - Phenomenology · Physics 2026-02-26 Juan Barranco , Argelia Bernal , Víctor Jaramillo , Darío Núñez , Milton Ruiz

We prove linear semi-stability for a large class of Einstein metrics of non-positive scalar curvature. More precisely, we show that any Einstein $n$-manifold with non-positive scalar curvature carrying a parallel twisted pure spin$^r$…

Differential Geometry · Mathematics 2025-12-02 Diego Artacho
‹ Prev 1 4 5 6 7 8 10 Next ›