A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees
From MaRDI portal
Publication:4575666
DOI10.1137/1.9781611974331.ch85zbMath1410.68393OpenAlexW4231737678MaRDI QIDQ4575666
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch85
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Approximation algorithms (68W25)
Related Items