New Results of Fault Tolerant Geometric Spanners
暂无分享,去创建一个
[1] Pravin M. Vaidya,et al. A sparse graph almost as good as the complete graph on points inK dimensions , 1991, Discret. Comput. Geom..
[2] S. Rao Kosaraju,et al. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields , 1995, JACM.
[3] Jeffrey S. Salowe. Constructing multidimensional spanner graphs , 1991, Int. J. Comput. Geom. Appl..
[4] Kenneth L. Clarkson,et al. Approximation algorithms for shortest path motion planning , 1987, STOC.
[5] Tamás Lukovszki,et al. Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time , 1998, ESA.
[6] Satish Rao,et al. Approximating geometrical graphs via “spanners” and “banyans” , 1998, STOC '98.
[7] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.
[8] Michiel H. M. Smid,et al. Randomized and deterministic algorithms for geometric spanners of small diameter , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[9] Carl Gutwin,et al. Classes of graphs which approximate the complete euclidean graph , 1992, Discret. Comput. Geom..
[10] D. Warren,et al. Improved Approximation Schemes for Geometrical Graphs Via Spanners and Banyans , 1998, STOC 1998.
[11] Andrew Chi-Chih Yao,et al. On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..
[12] Giri Narasimhan,et al. Efficient algorithms for constructing fault-tolerant geometric spanners , 1998, STOC '98.
[13] J. Mark Keil,et al. Approximating the Complete Euclidean Graph , 1988, Scandinavian Workshop on Algorithm Theory.
[14] Michiel H. M. Smid,et al. Euclidean spanners: short, thin, and lanky , 1995, STOC '95.
[15] Paul Chew,et al. There is a planar graph almost as good as the complete graph , 1986, SCG '86.
[16] Michiel H. M. Smid,et al. Lower bounds for computing geometric spanners and approximate shortest paths , 1996, Discret. Appl. Math..