In their seminal paper on Euclidean minimum spanning trees [Discrete & Computational Geometry, 1992], Monma and Suri proved that any tree of maximum degree 5 admits a planar embedding as a Euclidean minimum spanning tree. Their algorithm constructs embeddings with exponential area; however, the authors conjectured that cn × cn area is sometimes required to embed an n-vertex tree of maximum degree 5 as a Euclidean minimum spanning tree, for some constant c > 1. In this paper, we prove the first exponential lower bound on the area requirements for embedding trees as Euclidean minimum spanning trees. © 2011 Springer-Verlag.
CITATION STYLE
Angelini, P., Bruckdorfer, T., Chiesa, M., Frati, F., Kaufmann, M., & Squarcella, C. (2011). On the area requirements of Euclidean minimum spanning trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6844 LNCS, pp. 25–36). https://doi.org/10.1007/978-3-642-22300-6_3
Mendeley helps you to discover research relevant for your work.