Author:
Angelini Patrizio,Bruckdorfer Till,Chiesa Marco,Frati Fabrizio,Kaufmann Michael,Squarcella Claudio
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Angelini, P., Bruckdorfer, T., Chiesa, M., Frati, F., Kaufmann, M., Squarcella, C.: On the area requirements of Euclidean minimum spanning trees. Technical Report RT-DIA-183-2011, Dept. Comp. Sci. Autom., Roma Tre University (2011)
2. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)
3. Bose, P., Lenhart, W., Liotta, G.: Characterizing proximity trees. Algorithmica 16(1), 83–110 (1996)
4. Chan, T.M.: Euclidean bounded-degree spanning tree ratios. Discr. Comp. Geom. 32(2), 177–194 (2004)
5. Lecture Notes in Computer Science;E. Giacomo Di,2010
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献