Packing plane spanning trees into a point set
Financiación H2020 / H2020 Funds
Resumen: Let P be a set of n points in the plane in general position. We show that at least ¿n/3¿ plane spanning trees can be packed into the complete geometric graph on P. This improves the previous best known lower bound O(n). Towards our proof of this lower bound we show that the center of a set of points, in the d-dimensional space in general position, is of dimension either 0 or d.
Idioma: Inglés
DOI: 10.1016/j.comgeo.2020.101653
Año: 2020
Publicado en: Computational Geometry: Theory and Applications 90 (2020), 101653 [5 pp.]
ISSN: 0925-7721

Factor impacto JCR: 0.537 (2020)
Categ. JCR: MATHEMATICS, APPLIED rank: 255 / 265 = 0.962 (2020) - Q4 - T3
Categ. JCR: MATHEMATICS rank: 288 / 330 = 0.873 (2020) - Q4 - T3

Factor impacto SCIMAGO: 0.354 - Computational Mathematics (Q3) - Computational Theory and Mathematics (Q3) - Geometry and Topology (Q3) - Control and Optimization (Q3) - Computer Science Applications (Q3)

Financiación: info:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECT
Financiación: info:eu-repo/grantAgreement/ES/MINECO/MTM2015-63791-R
Tipo y forma: Article (PostPrint)
Área (Departamento): Área Estadís. Investig. Opera. (Dpto. Métodos Estadísticos)

Creative Commons You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use. You may not use the material for commercial purposes. If you remix, transform, or build upon the material, you may not distribute the modified material.


Exportado de SIDERAL (2021-09-02-09:33:58)


Visitas y descargas

Este artículo se encuentra en las siguientes colecciones:
Articles > Artículos por área > Estadística e Investigación Operativa



 Record created 2021-05-07, last modified 2021-09-02


Postprint:
 PDF
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)