Imagen de Portada

Tree covers of size $2$ for the Euclidean plane

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bikeev, Artur, Kupavskii, Andrey, Turevskii, Maxim
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Vertices of Delta-modular Polyhedra
por: Mikhail, Bludov, et al.
Publicado: (2025)

Packing unequal disks in the Euclidean plane
por: Fernique, Thomas
Publicado: (2023)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
por: Bhore, Sujoy, et al.
Publicado: (2024)

Optimal Euclidean Tree Covers
por: Chang, Hsien-Chih, et al.
Publicado: (2024)

Intersecting families with covering number $3$
por: Kupavskii, Andrey
Publicado: (2024)

Covering the Euclidean Plane by a Pair of Trees
por: Le, Hung, et al.
Publicado: (2025)

Parameterized and approximation algorithms for coverings points with segments in the plane
por: Kowalska, Katarzyna, et al.
Publicado: (2024)

Equicovering masses in the Euclidean plane
por: Espinosa-García, Manuel A., et al.
Publicado: (2025)

Non-Euclidean Erdős-Anning Theorems
por: Eppstein, David
Publicado: (2024)

2--elementary rational covers of the plane
por: Ciliberto, Ciro
Publicado: (2026)

Approximating Gromov-Hausdorff Distance in Euclidean Space
por: Majhi, Sushovan, et al.
Publicado: (2019)

Metric Lines in the Special Euclidean group on the plane
por: Wang, Y., et al.
Publicado: (2024)

Euclidean Steiner Shallow-Light Trees in Higher Dimensions
por: Frost, Devin, et al.
Publicado: (2026)

Searching in Euclidean Spaces with Predictions
por: Cabello, Sergio, et al.
Publicado: (2024)

Euclidean TSP in Narrow Strips
por: Alkema, Henk, et al.
Publicado: (2020)

Approximating Euclidean Shallow-Light Trees
por: Le, Hung, et al.
Publicado: (2025)

Configurations in the Euclidean plane associated to a system of equations
por: Colangelo, Francesco
Publicado: (2025)

A characterisation of Euclidean normed planes via bisectors
por: Sánchez, Javier Cabello, et al.
Publicado: (2024)

Cutting corners
por: Kupavskii, Andrey, et al.
Publicado: (2022)

Multipacking in Euclidean Metric Space
por: Das, Arun Kumar, et al.
Publicado: (2024)

The Euclidean $k$-Matching Problem is NP-hard
por: Díaz-Báñez, José-Miguel, et al.
Publicado: (2025)

Embedding Graphs as Euclidean kNN-Graphs
por: Schibler, T., et al.
Publicado: (2025)

Near-Optimal Euclidean Locality-Sensitive Orderings
por: Gao, Zhimeng, et al.
Publicado: (2023)

Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra
por: Dakhno, Grigorii, et al.
Publicado: (2024)

Towards Non-Euclidean Foundation Models: Advancing AI Beyond Euclidean Frameworks
por: Yang, Menglin, et al.
Publicado: (2025)

Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity
por: Bhore, Sujoy, et al.
Publicado: (2026)

Non-dissective coverings by planks
por: Kupavskii, Andrey, et al.
Publicado: (2025)

Triangle covering problems and the Viterbo inequality in the plane
por: Balitskiy, Alexey, et al.
Publicado: (2026)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
por: Har-Peled, Sariel, et al.
Publicado: (2014)

Linear time single-source shortest path algorithms in Euclidean graph classes
por: Gudmundsson, Joachim, et al.
Publicado: (2026)

Space Complexity of Euclidean Clustering
por: Zhu, Xiaoyi, et al.
Publicado: (2024)

On vertices of frontals in the Euclidean plane
por: Nakatsuyama, Nozomi, et al.
Publicado: (2024)

Euclidean distance degree defect of singular projective varieties
por: Maxim, Laurenţiu G., et al.
Publicado: (2026)

Expected Length of the Euclidean Minimum Spanning Tree and 1-norms of Chromatic Persistence Diagrams in the Plane
por: Draganov, Ondřej, et al.
Publicado: (2025)

Vietoris--Rips Shadow for Euclidean Graph Reconstruction
por: Komendarczyk, Rafal, et al.
Publicado: (2025)

Euclidean Maximum Matchings in the Plane---Local to Global
por: Biniaz, Ahmad, et al.
Publicado: (2024)

Solving Euclidean Problems by Isotropic Initialization
por: Yorov, Khusrav, et al.
Publicado: (2025)

Euclidean k-center Fair Clusterings
por: Moritaka, Ayano, et al.
Publicado: (2025)

A family of maps and a vector field on plane polygons
por: Arnold, Maxim, et al.
Publicado: (2024)

On the complexity of covering points by guillotine cuts
por: Garijo, Delia, et al.
Publicado: (2026)