Related papers: Light Spanners with Small Hop-Diameter

In a coalescence plus independent fragmentation approach we calculate the $p_T$ spectra of the main hadrons: $\pi, K, p, \bar p, \Lambda, \phi$ in a wide range of transverse momentum from low $p_T$ up to about 10 GeV. The approach in its…

Motivated by a recent work of Chen-Zheng [8] on Strominger space forms, we prove that a compact Hermitian surface with pointwise constant holomorphic sectional curvature with respect to a Gauduchon connection $\nabla^t $ is either K\"ahler,…

Miller et al. \cite{MPVX15} devised a distributed\footnote{They actually showed a PRAM algorithm. The distributed algorithm with these properties is implicit in \cite{MPVX15}.} algorithm in the CONGEST model, that given a parameter $k =…

A \emph{spanner} of a graph $G$ is a subgraph $H$ that approximately preserves shortest path distances in $G$. Spanners are commonly applied to compress computation on metric spaces corresponding to weighted input graphs. Classic spanner…

Additive spanners are fundamental graph structures with wide applications in network design, graph sparsification, and distance approximation. In particular, a $4$-additive spanner is a subgraph that preserves all pairwise distances up to…

We give a simple algorithm for maintaining a $n^{o(1)}$-approximate spanner $H$ of a graph $G$ with $n$ vertices as $G$ receives edge updates by reduction to the dynamic All-Pairs Shortest Paths (APSP) problem. Given an initially empty…

Graph spanners and emulators are sparse structures that approximately preserve distances of the original graph. While there has been an extensive amount of work on additive spanners, so far little attention was given to weighted graphs.…

The author defines and analyzes the $1/k$ length spectra, $L_{1/k}(M)$, whose union, over all $k\in \NN$ is the classical length spectrum. These new length spectra are shown to converge in the sense that $\lim_{i\to\infty} L_{1/k}(M_i)…

We study the computational complexity of exact cardinality-constrained minimum Riesz $s$-energy subset selection in finite metric spaces: given $n$ points, select $k<n$ points of minimum Riesz $s$-energy. The objective sums inverse-power…

An $(\alpha,\beta)$-spanner of an $n$-vertex graph $G=(V,E)$ is a subgraph $H$ of $G$ satisfying that $dist(u, v, H) \leq \alpha \cdot dist(u, v, G)+\beta$ for every pair $(u, v)\in V \times V$, where $dist(u,v,G')$ denotes the distance…

The Minimal Supersymmetric Standard Model opens the possibility of electroweak baryogenesis provided that the light scalar top quark (stop) is lighter than the top quark. In addition, the lightest neutralino is an ideal candidate to explain…

An algorithm is proposed for constructing directed spanning forests of the minimum weight, in which the maximum possible degree of affinity between the minimum forests is preserved when the number of trees changes. The correctness of the…

It was recently found that there are very close connections between the existence of additive spanners (subgraphs where all distances are preserved up to an additive stretch), distance preservers (subgraphs in which demand pairs have their…

$\newcommand{\eps}{\varepsilon}\newcommand{\tldO}{\widetilde{O}}$Consider the problem of constructing weak $\eps$-nets where the stabbing elements are lines or $k$-flats instead of points. We study this problem in the simplest setting where…

This paper systematically investigates the interaction mechanism between metric structures and mirror transformations in Spencer complexes of compatible pairs. Our core contribution is the establishment of mirror symmetry for Spencer-Hodge…

We consider a one-dimensional simple random walk surviving among a field of static soft traps : each time it meets a trap the walk is killed with probability 1--e --$\beta$ , where $\beta$ is a positive and fixed parameter. The positions of…

We propose the simplest possible renormalizable extension of the Standard Model - the addition of just one singlet scalar field - as a minimalist model for non-baryonic dark matter. Such a model is characterized by only three parameters in…

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…

The tree spanner problem for a graph $G$ is as follows: For a given integer $k$, is there a spanning tree $T$ of $G$ (called a tree $k$-spanner) such that the distance in $T$ between every pair of vertices is at most $k$ times their…

A $(1+\varepsilon)\textit{-stretch tree cover}$ of a metric space is a collection of trees, where every pair of points has a $(1+\varepsilon)$-stretch path in one of the trees. The celebrated $\textit{Dumbbell Theorem}$ [Arya et~al.…