No article text was recorded for this version.
non-crossing geometric routing
Version 1 of 114 papers32 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On notions of distortion and an almost minimum spanning tree with constant average distortion
- Blog: Truly Optimal Euclidean Spanners
- Blog: Towards Instance-Optimal Euclidean Spanners
- Blog: Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function
- Blog: Self-Approaching Graphs
- Blog: Euclidean Steiner Spanners: Light and Sparse
- Blog: Near-Optimal Spanners for General Graphs in (Nearly) Linear Time
- Blog: On Euclidean Steiner (1+ε)-Spanners
- Blog: Lowest-Degree k-Spanner: Approximation and Hardness
- Blog: Almost All Even Yao-Yao Graphs Are Spanners
- Blog: Graph spanners: A tutorial review
- Blog: A Unified Framework of Light Spanners I: Fast (Yet Optimal) Constructions
- Blog: A Unified Framework for Light Spanners
- Blog: Graph Algorithms: Distributed Meets Dynamic (Dagstuhl Seminar 24471)
History & citation
Current · Permanent link
- This direction split from Optimal Lightness in Distance Preserving Spanners (71% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_non_crossing_geometric_routing_d57bb65d,
title = {non-crossing geometric routing},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-crossing-geometric-routing/rdr_d57bb65d05e240db9e7fef77a88c28ef},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_non_crossing_geometric_routing_d57bb65d_v1,
title = {non-crossing geometric routing},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-crossing-geometric-routing/rdr_d57bb65d05e240db9e7fef77a88c28ef/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}