Saved in:
| Main Authors: | Le, Hung, Milenković, Lazar, Solomon, Shay, Zhang, Tianyi |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.11507 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Optimal Euclidean Tree Covers
by: Chang, Hsien-Chih, et al.
Published: (2024)
by: Chang, Hsien-Chih, et al.
Published: (2024)
Approximating Euclidean Shallow-Light Trees
by: Le, Hung, et al.
Published: (2025)
by: Le, Hung, et al.
Published: (2025)
Towards Instance-Optimal Euclidean Spanners
by: Le, Hung, et al.
Published: (2024)
by: Le, Hung, et al.
Published: (2024)
Optimal Bounds for Spanners and Tree Covers in Doubling Metrics
by: La, An, et al.
Published: (2025)
by: La, An, et al.
Published: (2025)
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
by: Le, Hung, et al.
Published: (2023)
by: Le, Hung, et al.
Published: (2023)
Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
by: Le, Hung, et al.
Published: (2021)
by: Le, Hung, et al.
Published: (2021)
Tree-Like Shortcuttings of Trees
by: Le, Hung, et al.
Published: (2025)
by: Le, Hung, et al.
Published: (2025)
Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Light Spanners with Small Hop-Diameter
by: Bhore, Sujoy, et al.
Published: (2025)
by: Bhore, Sujoy, et al.
Published: (2025)
ETH Flippers Approach to Parallel Reconfiguration of Triangulations: SAT formulation and Heuristics
by: Battini, Lorenzo, et al.
Published: (2026)
by: Battini, Lorenzo, et al.
Published: (2026)
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
by: Le, Hung, et al.
Published: (2021)
by: Le, Hung, et al.
Published: (2021)
Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024)
by: Biniaz, Ahmad, et al.
Published: (2024)
An Improved Bound for Plane Covering Paths
by: Akitaya, Hugo A., et al.
Published: (2025)
by: Akitaya, Hugo A., et al.
Published: (2025)
Expected Length of the Euclidean Minimum Spanning Tree and 1-norms of Chromatic Persistence Diagrams in the Plane
by: Draganov, Ondřej, et al.
Published: (2025)
by: Draganov, Ondřej, et al.
Published: (2025)
Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
by: Chan, Timothy M., et al.
Published: (2026)
by: Chan, Timothy M., et al.
Published: (2026)
Intuitive norms are Euclidean
by: Moran, Shay, et al.
Published: (2025)
by: Moran, Shay, et al.
Published: (2025)
Fine-Grained Complexity of Continuous Euclidean k-Center
by: Blank, Lotte, et al.
Published: (2026)
by: Blank, Lotte, et al.
Published: (2026)
Long Plane Trees
by: Cabello, Sergio, et al.
Published: (2021)
by: Cabello, Sergio, et al.
Published: (2021)
Tree covers of size $2$ for the Euclidean plane
by: Bikeev, Artur, et al.
Published: (2025)
by: Bikeev, Artur, et al.
Published: (2025)
Non-Euclidean Erdős-Anning Theorems
by: Eppstein, David
Published: (2024)
by: Eppstein, David
Published: (2024)
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
by: Bhore, Sujoy, et al.
Published: (2024)
by: Bhore, Sujoy, et al.
Published: (2024)
Undecidability of Translational Tiling of the Plane with Four Tiles
by: Yang, Chao, et al.
Published: (2025)
by: Yang, Chao, et al.
Published: (2025)
Minimum Plane Bichromatic Spanning Trees
by: Akitaya, Hugo A., et al.
Published: (2024)
by: Akitaya, Hugo A., et al.
Published: (2024)
Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)
by: Majhi, Sushovan, et al.
Published: (2019)
On $k$-Plane Insertion into Plane Drawings
by: Katheder, Julia, et al.
Published: (2024)
by: Katheder, Julia, et al.
Published: (2024)
Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
by: Yang, Chao, et al.
Published: (2025)
by: Yang, Chao, et al.
Published: (2025)
The Power of Recursive Embeddings for $\ell_p$ Metrics
by: Krauthgamer, Robert, et al.
Published: (2025)
by: Krauthgamer, Robert, et al.
Published: (2025)
Towards Non-Euclidean Foundation Models: Advancing AI Beyond Euclidean Frameworks
by: Yang, Menglin, et al.
Published: (2025)
by: Yang, Menglin, et al.
Published: (2025)
Euclidean Steiner Shallow-Light Trees in Higher Dimensions
by: Frost, Devin, et al.
Published: (2026)
by: Frost, Devin, et al.
Published: (2026)
Searching in Euclidean Spaces with Predictions
by: Cabello, Sergio, et al.
Published: (2024)
by: Cabello, Sergio, et al.
Published: (2024)
Euclidean TSP in Narrow Strips
by: Alkema, Henk, et al.
Published: (2020)
by: Alkema, Henk, et al.
Published: (2020)
Dynamic Locality Sensitive Orderings in Doubling Metrics
by: La, An, et al.
Published: (2024)
by: La, An, et al.
Published: (2024)
A Lossless Deamortization for Dynamic Greedy Set Cover
by: Solomon, Shay, et al.
Published: (2024)
by: Solomon, Shay, et al.
Published: (2024)
Untangling Segments in the Plane
by: da Fonseca, Guilherme D., et al.
Published: (2025)
by: da Fonseca, Guilherme D., et al.
Published: (2025)
Multipacking in Euclidean Metric Space
by: Das, Arun Kumar, et al.
Published: (2024)
by: Das, Arun Kumar, et al.
Published: (2024)
The Euclidean $k$-Matching Problem is NP-hard
by: Díaz-Báñez, José-Miguel, et al.
Published: (2025)
by: Díaz-Báñez, José-Miguel, et al.
Published: (2025)
Embedding Graphs as Euclidean kNN-Graphs
by: Schibler, T., et al.
Published: (2025)
by: Schibler, T., et al.
Published: (2025)
Near-Optimal Euclidean Locality-Sensitive Orderings
by: Gao, Zhimeng, et al.
Published: (2023)
by: Gao, Zhimeng, et al.
Published: (2023)
Constrained Flips in Plane Spanning Trees
by: Aichholzer, Oswin, et al.
Published: (2025)
by: Aichholzer, Oswin, et al.
Published: (2025)
Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-$f$ Time Barrier
by: Bukov, Anton, et al.
Published: (2023)
by: Bukov, Anton, et al.
Published: (2023)
Similar Items
-
Optimal Euclidean Tree Covers
by: Chang, Hsien-Chih, et al.
Published: (2024) -
Approximating Euclidean Shallow-Light Trees
by: Le, Hung, et al.
Published: (2025) -
Towards Instance-Optimal Euclidean Spanners
by: Le, Hung, et al.
Published: (2024) -
Optimal Bounds for Spanners and Tree Covers in Doubling Metrics
by: La, An, et al.
Published: (2025) -
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
by: Le, Hung, et al.
Published: (2023)