Geometric Spanners
Geometric Spanners is a geometric graph in which the shortest path distance between any two vertices is at most a constant factor (called the stretch factor) times their Euclidean distance, thereby approximating the complete Euclidean graph with sparse connectivity.
54
Publications
2.8K
Citations
88
Authors
62
Institutions
Publications per year
2017–2026
1
Variants
Geometric Spanner Graphs
Parents
54
Geometric spanners for wireless ad hoc networks
Khaled M. Alzoubi, X.‐Y. Li, Y. Wang et al. · IEEE Transactions on Parallel and Distributed Systems · 2003 · 239 citations
Geometric Spanners for Routing in Mobile Networks
Sunil Arya, Gautam Das, David M. Mount et al. · 1995 · 205 citations
Approximating geometrical graphs via “spanners” and “banyans”
Satish Rao, Warren D. Smith · 1998 · 203 citations · Full text
Spanners and emulators with sublinear distance errors
Mikkel Thorup, Uri Zwick · Symposium on Discrete Algorithms · 2006 · 132 citations
1–5 of 54
88
12
h-index
7
h-index
7
h-index
6
h-index
5
h-index
1–5 of 88
62

Carleton University
Ottawa, Canada
12 h-index
25 publications
771 citations

Weizmann Institute of Science
Rehovot, Israel
6 h-index
6 publications
172 citations
Max Planck Society
Munich, Germany
5 h-index
15 publications
1.1K citations
Ben-Gurion University of the Negev
Beersheba, Israel
5 h-index
10 publications
194 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
4 h-index
4 publications
151 citations

Data61
Sydney, Australia
4 h-index
4 publications
115 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
3 publications
227 citations

Yazd University
Yazd, Iran
3 h-index
3 publications
74 citations
1–8 of 62
5 publications · 224 citations
5
h-index
4 publications · 177 citations
4
h-index
4 publications · 178 citations
4
h-index
4 publications · 117 citations
4
h-index
2 publications · 30 citations
2
h-index
1–5