中文
相关论文

相关论文: Balancing Degree, Diameter and Weight in Euclidean…

200 篇论文

In a seminal STOC'95 paper, titled "Euclidean spanners: short, thin and lanky", Arya et al. devised a construction of Euclidean $(1+\eps)$-spanners that achieves constant degree, diameter $O(\log n)$, and weight $O(\log^2 n) \cdot…

数据结构与算法 · 计算机科学 2012-11-28 Michael Elkin , Shay Solomon

It is known that any $n$-point set in the $d$-dimensional Euclidean space $\mathbb{R}^d$, for $d = O(1)$, admits: 1) a $(1+\epsilon)$-spanner with maximum degree $\tilde{O}(\epsilon^{-d+1})$ and with lightness $\tilde{O}(\epsilon^{-d})$; 2)…

计算几何 · 计算机科学 2026-03-30 An La , Hung Le , Shay Solomon , Cuong Than , Vinayak , Shuang Yang , Tianyi Zhang

Given a set $S$ of $n$ points in the plane and a parameter $\varepsilon>0$, a Euclidean $(1+\varepsilon)$-spanner is a geometric graph $G=(S,E)$ that contains, for all $p,q\in S$, a $pq$-path of weight at most $(1+\varepsilon)\|pq\|$. We…

计算几何 · 计算机科学 2023-12-27 Csaba D. Tóth

In STOC'95 \cite{ADMSS95} Arya et al.\ showed that for any set of $n$ points in $\mathbb R^d$, a $(1+\epsilon)$-spanner with diameter at most 2 (respectively, 3) and $O(n \log n)$ edges (resp., $O(n \log \log n)$ edges) can be built in $O(n…

计算几何 · 计算机科学 2011-08-31 Shay Solomon

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…

计算几何 · 计算机科学 2024-09-18 Hung Le , Shay Solomon , Cuong Than , Csaba D. Tóth , Tianyi Zhang

The FOCS'19 paper of Le and Solomon, culminating a long line of research on Euclidean spanners, proves that the lightness (normalized weight) of the greedy $(1+\epsilon)$-spanner in $\mathbb{R}^d$ is $\tilde{O}(\epsilon^{-d})$ for any $d =…

计算几何 · 计算机科学 2020-10-16 Hung Le , Shay Solomon

Recently Elkin and Solomon gave a construction of spanners for doubling metrics that has constant maximum degree, hop-diameter O(log n) and lightness O(log n) (i.e., weight O(log n)w(MST). This resolves a long standing conjecture proposed…

数据结构与算法 · 计算机科学 2012-07-05 T-H. Hubert Chan , Mingfei Li , Li Ning

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…

计算几何 · 计算机科学 2013-03-29 Sanjiv Kapoor , XiangYang Li

Lightness is a fundamental parameter for Euclidean spanners; it is the ratio of the spanner weight to the weight of the minimum spanning tree of a finite set of points in $\mathbb{R}^d$. In a recent breakthrough, Le and Solomon (2019)…

计算几何 · 计算机科学 2021-03-30 Sujoy Bhore , Csaba D. Tóth

Spanners for low dimensional spaces (e.g. Euclidean space of constant dimension, or doubling metrics) are well understood. This lies in contrast to the situation in high dimensional spaces, where except for the work of Har-Peled, Indyk and…

数据结构与算法 · 计算机科学 2018-04-23 Arnold Filtser , Ofer Neiman

Lightness and sparsity are two natural parameters for Euclidean $(1+\varepsilon)$-spanners. Classical results show that, when the dimension $d\in \mathbb{N}$ and $\varepsilon>0$ are constant, every set $S$ of $n$ points in $d$-space admits…

计算几何 · 计算机科学 2021-03-16 Sujoy Bhore , Csaba D. Tóth

We show that for every $n$-point metric space $M$ there exists a spanning tree $T$ with unweighted diameter $O(\log n)$ and weight $\omega(T) = O(\log n) \cdot \omega(MST(M))$. Moreover, there is a designated point $rt$ such that for every…

计算几何 · 计算机科学 2011-08-31 Yefim Dinitz , Michael Elkin , Shay Solomon

In STOC'95 [ADMSS'95] Arya et al. showed that any set of $n$ points in $\mathbb R^d$ admits a $(1+\epsilon)$-spanner with hop-diameter at most 2 (respectively, 3) and $O(n \log n)$ edges (resp., $O(n \log \log n)$ edges). They also gave a…

数据结构与算法 · 计算机科学 2022-01-03 Hung Le , Lazar Milenkovic , Shay Solomon

A Euclidean noncrossing Steiner $(1+\epsilon)$-spanner for a point set $P\subset\mathbb{R}^2$ is a planar straight-line graph that, for any two points $a, b \in P$, contains a path whose length is at most $1+\epsilon$ times the Euclidean…

Let ${\cal P}$ be a set of $n$ points embedded in the plane, and let ${\cal C}$ be the complete Euclidean graph whose point-set is ${\cal P}$. Each edge in ${\cal C}$ between two points $p, q$ is realized as the line segment $[pq]$, and is…

计算几何 · 计算机科学 2016-03-15 Iyad Kanj , Ljubomir Perković , Duru Türkoǧlu

Euclidean spanners are important geometric structures, having found numerous applications over the years. Cornerstone results in this area from the late 80s and early 90s state that for any $d$-dimensional $n$-point Euclidean space, there…

计算几何 · 计算机科学 2021-04-06 Hung Le , Shay Solomon

In this paper we devise an optimal construction of fault-tolerant spanners for doubling metrics. Specifically, for any $n$-point doubling metric, any $\eps > 0$, and any integer $0 \le k \le n-2$, our construction provides a…

数据结构与算法 · 计算机科学 2013-05-09 Shay Solomon

Lightness and sparsity are two natural parameters for Euclidean $(1+\varepsilon)$-spanners. Classical results show that, when the dimension $d\in \mathbb{N}$ and $\varepsilon>0$ are constant, every set $S$ of $n$ points in $d$-space admits…

计算几何 · 计算机科学 2022-06-22 Sujoy Bhore , Csaba D. Toth

In STOC'95 Arya et al. (1995) conjectured that for any constant dimensional $n$-point Euclidean space, a $(1+\eps)$-spanner with constant degree, hop-diameter $O(\log n)$ and weight $O(\log n) \cdot \omega(MST)$ can be built in $O(n \log…

数据结构与算法 · 计算机科学 2013-01-01 Shay Solomon

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…

数据结构与算法 · 计算机科学 2024-08-28 An La , Hung Le
‹ 上一页 1 2 3 10 下一页 ›