Author:
Abam M. A.,de Berg M.,Farshi M.,Gudmundsson J.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference29 articles.
1. Bollobás, B., Scott, A.: On separating systems. Eur. J. Comb. 28(4), 1068–1071 (2007)
2. Callahan, P.B., Kosaraju, S.R.: Faster algorithms for some geometric graph problems in higher dimensions. In: SODA’93: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 291–300. Society for Industrial and Applied Mathematics, Philadelphia (1993)
3. Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM 42, 67–90 (1995)
4. Chew, L.P.: There is a planar graph almost as good as the complete graph. In SCG’86: Proceedings of the 2nd Annual ACM Symposium on Computational Geometry, pp. 169–177 (1986)
5. Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In STOC’87: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 56–65 (1987)
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献