Author:
Margenstern Maurice,Morita Kenichi
Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. S. Arora, Polynomial time approximation schemes for euclidean TSP and other geometric problems, Proc. 37th IEEE FOCS, 1996.
2. Computers and Intractability;Garey,1979
3. Plane Geometry and its Groups;Guggenheimer,1967
4. Kolmogorov machines and related issues;Gurevich;Bull. European Assoc. Theor. Comput. Sci.,1988
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献