Author:
Schindelhauer Christian,Volbert Klaus,Ziegler Martin
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. S. Arora, M. Grigni, D.R. Karger, P.N. Klein, A. Woloszyn, A polynomial-time approximation scheme for weighted planar graph TSP, in: Symposium on Discrete Algorithms (SODA'98), 1998, pp 33–41
3. L.P. Chew, There is a planar graph almost as good as the complete graph, in: 2nd ACM Symposium on Computational Geometry (SoCG '86), 1986, pp. 169–177
4. Approximation algorithms for shortest path motion planning;Clarkson,1987
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Online Euclidean Spanners;ACM Transactions on Algorithms;2024-08-08
2. Online Spanners in Metric Spaces;SIAM Journal on Discrete Mathematics;2024-03-12
3. Faster Edge‐Path Bundling through Graph Spanners;Computer Graphics Forum;2023-04-03
4. Euclidean Steiner Spanners: Light and Sparse;SIAM Journal on Discrete Mathematics;2022-09
5. A Wireless Low-power System for Digital Identification of Examinees (Including Covid-19 Checks);Proceedings of the 11th International Conference on Sensor Networks;2022