Euclidean Steiner shallow-light trees
From MaRDI portal
Publication:4635570
DOI10.1145/2582112.2582160zbMATH Open1397.68148OpenAlexW1997570556MaRDI QIDQ4635570FDOQ4635570
Authors: Shay Solomon
Publication date: 23 April 2018
Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://jocg.org/index.php/jocg/article/view/2981
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cited In (7)
- Steiner shallow-light trees are exponentially lighter than spanning ones
- Euclidean Steiner spanners: light and sparse
- Narrow-Shallow-Low-Light Trees with and without Steiner Points
- Truly Optimal Euclidean Spanners
- Euclidean Steiner shallow-light trees
- Light Euclidean Spanners with Steiner Points
- Narrow-Shallow-Low-Light Trees with and without Steiner Points
This page was built for publication: Euclidean Steiner shallow-light trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635570)