The following pages link to Geometric Spanner Networks (Q3445775):
Displaying 50 items.
- Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree (Q2258072) (← links)
- Conic nearest neighbor queries and approximate Voronoi diagrams (Q2261577) (← links)
- The \(\varTheta_5\)-graph is a spanner (Q2261580) (← links)
- Minimizing the sum of distances to a server in a constraint network (Q2330034) (← links)
- An improved upper bound on dilation of regular polygons (Q2330038) (← links)
- Geometric spanner games (Q2330124) (← links)
- Average stretch factor: how low does it go? (Q2340408) (← links)
- Reprint of: Theta-3 is connected (Q2341694) (← links)
- Fast algorithms for approximate Fréchet matching queries in geometric trees (Q2349741) (← links)
- Linear-size approximations to the Vietoris-Rips filtration (Q2391709) (← links)
- Upper and lower bounds for online routing on Delaunay triangulations (Q2408218) (← links)
- Fault tolerancy of continuous Yao graph of angle less than \(2\pi/5\) (Q2419798) (← links)
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm (Q2429332) (← links)
- On certain geometric properties of the Yao-Yao graphs (Q2436661) (← links)
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
- A rounding algorithm for approximating minimum Manhattan networks (Q2474072) (← links)
- Near isometric terminal embeddings for doubling metrics (Q2665904) (← links)
- On path-greedy geometric spanners (Q2678257) (← links)
- Lattice Spanners of Low Degree (Q2795942) (← links)
- Lattice spanners of low degree (Q2821117) (← links)
- New Doubling Spanners: Better and Simpler (Q2954370) (← links)
- Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition (Q2961543) (← links)
- Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas (Q2980915) (← links)
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces (Q3057631) (← links)
- YAO GRAPHS SPAN THETA GRAPHS (Q3166731) (← links)
- On the Power of the Semi-Separated Pair Decomposition (Q3183436) (← links)
- Connect the Dot: Computing Feed-Links with Minimum Dilation (Q3183440) (← links)
- Computing Minimum Dilation Spanning Trees in Geometric Graphs (Q3196394) (← links)
- Upper and Lower Bounds for Online Routing on Delaunay Triangulations (Q3452783) (← links)
- Spanners of Additively Weighted Point Sets (Q3512473) (← links)
- Computing the Greedy Spanner in Near-Quadratic Time (Q3512475) (← links)
- On the expected maximum degree of Gabriel and Yao graphs (Q3558941) (← links)
- COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (Q3562852) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
- ON SPANNERS OF GEOMETRIC GRAPHS (Q3620618) (← links)
- DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE (Q3636312) (← links)
- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension (Q3644728) (← links)
- Spanners for Directed Transmission Graphs (Q4581909) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE (Q4650090) (← links)
- Testing Euclidean Spanners (Q4933382) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- On the Stretch Factor of Polygonal Chains (Q5001847) (← links)
- Maximum Area Axis-Aligned Square Packings. (Q5005181) (← links)
- (Q5009579) (← links)
- (Q5009588) (← links)
- Euclidean Steiner Spanners: Light and Sparse (Q5043642) (← links)
- Truly Optimal Euclidean Spanners (Q5071083) (← links)
- (Q5088946) (← links)
- Approximating Distance Measures for the Skyline (Q5091120) (← links)