Author:
Aronov Boris,de Berg Mark,Cheong Otfried,Gudmundsson Joachim,Haverkort Herman,Smid Michiel,Vigneron Antoine
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference27 articles.
1. Geometric spanners for wireless ad hoc networks;Alzoubi;IEEE Transactions on Parallel and Distributed Systems,2003
2. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields;Callahan;Journal of the ACM,1995
3. New sparseness results on graph spanners;Chandra;International Journal of Computational Geometry and Applications,1995
4. O. Cheong, H. Haverkort, M. Lee, Computing a minimum-dilation spanning tree is NP-hard, in: Proc. of Computing: The Australasian Theory Symposium, in: CRPIT, vol. 65, 2007, pp. 15–24
5. Constructing degree-3 spanners with other sparseness properties;Das;International Journal of Foundations of Computer Science,1996
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Vertex Fault-Tolerant Geometric Spanners for Weighted Points;International Journal of Computational Geometry & Applications;2022-09
2. Improving the Dilation of a Metric Graph by Adding Edges;ACM Transactions on Algorithms;2022-07-31
3. Vertex fault-tolerant spanners for weighted points in polygonal domains;Discrete Mathematics, Algorithms and Applications;2022-04-11
4. Sparse hop spanners for unit disk graphs;Computational Geometry;2022-01
5. A Spanner for the Day After;Discrete & Computational Geometry;2020-08-06