:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Chang, Hsien-Chih, Conroy, Jonathan, Le, Hung, Milenkovic, Lazar, Solomon, Shay, Than, Cuong
Formato:	Preprint
Publicado:	2024
Materias:	Computational Geometry
Acceso en línea:	https://arxiv.org/abs/2403.17754
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
por: Le, Hung, et al.
Publicado: (2023)

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2025)

Towards Instance-Optimal Euclidean Spanners
por: Le, Hung, et al.
Publicado: (2024)

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

Tree-Like Shortcuttings of Trees
por: Le, Hung, et al.
Publicado: (2025)

Optimal Bounds for Spanners and Tree Covers in Doubling Metrics
por: La, An, et al.
Publicado: (2025)

Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
por: Le, Hung, et al.
Publicado: (2021)

Distance Approximating Minors for Planar and Minor-Free Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2025)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
por: Le, Hung, et al.
Publicado: (2021)

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

O(1)-Distortion Planar Emulators for String Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2025)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2024)

Light Spanners with Small Hop-Diameter
por: Bhore, Sujoy, et al.
Publicado: (2025)

Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
por: Chan, Timothy M., et al.
Publicado: (2026)

Single-Criteria Metric $r$-Dominating Set Problem via Minor-Preserving Support
por: Browne, Reilly, et al.
Publicado: (2026)

Approximate Light Spanners in Planar Graphs
por: Le, Hung, et al.
Publicado: (2025)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
por: Chan, Timothy M., et al.
Publicado: (2026)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
por: Chan, Timothy M., et al.
Publicado: (2025)

ETH Flippers Approach to Parallel Reconfiguration of Triangulations: SAT formulation and Heuristics
por: Battini, Lorenzo, et al.
Publicado: (2026)

Hop-Spanners for Geometric Intersection Graphs
por: Conroy, Jonathan B., et al.
Publicado: (2021)

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

Intuitive norms are Euclidean
por: Moran, Shay, et al.
Publicado: (2025)

Fine-Grained Complexity of Continuous Euclidean k-Center
por: Blank, Lotte, et al.
Publicado: (2026)

Dynamic Light Spanners in Doubling Metrics
por: Bhore, Sujoy, et al.
Publicado: (2026)

Near-Optimal Bounds for Parameterized Euclidean k-means
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

On Optimal Coreset Construction for Euclidean $(k,z)$-Clustering
por: Huang, Lingxiao, et al.
Publicado: (2022)

Tree covers of size $2$ for the Euclidean plane
por: Bikeev, Artur, et al.
Publicado: (2025)

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

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

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

The Power of Recursive Embeddings for $\ell_p$ Metrics
por: Krauthgamer, Robert, et al.
Publicado: (2025)

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)

Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

Dynamic Locality Sensitive Orderings in Doubling Metrics
por: La, An, et al.
Publicado: (2024)

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

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

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