Zobrazeno 1 - 10
of 40 462
pro vyhledávání: '"Spanners"'
Designing sparse directed spanners, which are subgraphs that approximately maintain distance constraints, has attracted sustained interest in TCS, especially due to their wide applicability, as well as the difficulty to obtain tight results. However,
Externí odkaz:
http://arxiv.org/abs/2412.05526
An $(\alpha,\beta)$ spanner of an edge weighted graph $G=(V,E)$ is a subgraph $H$ of $G$ such that for every pair of vertices $u$ and $v$, $d_{H}(u,v) \le \alpha \cdot d_G(u,v) + \beta W$, where $d_G(u,v)$ is the shortest path length from $u$ to $v$
Externí odkaz:
http://arxiv.org/abs/2411.07505
An $(\alpha,\beta)$-spanner of a weighted graph $G=(V,E)$, is a subgraph $H$ such that for every $u,v\in V$, $d_G(u,v) \le d_H(u,v)\le\alpha\cdot d_G(u,v)+\beta$. The main parameters of interest for spanners are their size (number of edges) and their
Externí odkaz:
http://arxiv.org/abs/2410.23826
We provide new algorithms for constructing spanners of arbitrarily edge- or vertex-colored graphs, that can endure up to $f$ failures of entire color classes. The failure of even a single color may cause a linear number of individual edge/vertex faul
Externí odkaz:
http://arxiv.org/abs/2410.07844
Given a point set $P$ in the Euclidean space, a geometric $t$-spanner $G$ is a graph on $P$ such that for every pair of points, the shortest path in $G$ between those points is at most a factor $t$ longer than the Euclidean distance between those poi
Externí odkaz:
http://arxiv.org/abs/2412.06316
Autor:
Buchin, Kevin, Kalb, Antonia, Maheshwari, Anil, Odak, Saeed, Smid, Michiel, Rehs, Carolin, Wong, Sampson
Given a point set $P$ in a metric space and a real number $t \geq 1$, an \emph{oriented $t$-spanner} is an oriented graph $\overrightarrow{G}=(P,\overrightarrow{E})$, where for every pair of distinct points $p$ and $q$ in $P$, the shortest oriented c
Externí odkaz:
http://arxiv.org/abs/2412.08165
Euclidean spanners are important geometric objects that have been extensively studied since the 1980s. The two most basic "compactness'' measures of a Euclidean spanner $E$ are the size (number of edges) $|E|$ and the weight (sum of edge weights) $\|
Externí odkaz:
http://arxiv.org/abs/2409.08227
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 (iii) a $+8
Externí odkaz:
http://arxiv.org/abs/2408.14638
Autor:
Har-Peled, Sariel, Lusardi, Maria C.
Let $P$ be a set of $n$ points in $\mathbb{R}^d$, and let $\varepsilon,\psi \in (0,1)$ be parameters. Here, we consider the task of constructing a $(1+\varepsilon)$-spanner for $P$, where every edge might fail (independently) with probability $1-\psi
Externí odkaz:
http://arxiv.org/abs/2407.01466