The Power of Recursive Embeddings for $\ell_p$ Metrics
Fuente:
arXiv
Saved in:
| Main Authors: | Krauthgamer, Robert, Petruschka, Nir, Sapir, Shay |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Fast Nearest Neighbor Search for $\ell_p$ Metrics
by: Krauthgamer, Robert, et al.
Published: (2026)
by: Krauthgamer, Robert, et al.
Published: (2026)
Lipschitz Decompositions of Finite $\ell_{p}$ Metrics
by: Krauthgamer, Robert, et al.
Published: (2025)
by: Krauthgamer, Robert, et al.
Published: (2025)
Fitting trees to $\ell_1$-hyperbolic distances
by: Yim, Joon-Hyeok, et al.
Published: (2024)
by: Yim, Joon-Hyeok, et al.
Published: (2024)
Time complexity of the Analyst's Traveling Salesman algorithm
by: Ramirez, Anthony, et al.
Published: (2022)
by: Ramirez, Anthony, et al.
Published: (2022)
On Approximability of Steiner Tree in $\ell_p$-metrics
by: Fleischmann, Henry, et al.
Published: (2023)
by: Fleischmann, Henry, et al.
Published: (2023)
Lower bounds for the universal TSP on the plane
by: Kravaris, Cosmas
Published: (2024)
by: Kravaris, Cosmas
Published: (2024)
Unweighted Layered Graph Traversal: Passing a Crown via Entropy Maximization
by: Bai, Xingjian, et al.
Published: (2024)
by: Bai, Xingjian, et al.
Published: (2024)
Nearly-Tight Bounds for Zonotope Containment and Beyond
by: Eisenbrand, Friedrich, et al.
Published: (2026)
by: Eisenbrand, Friedrich, et al.
Published: (2026)
Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the $\sqrt{n}$ Dimension Threshold
by: Guruswami, Venkatesan, et al.
Published: (2024)
by: Guruswami, Venkatesan, et al.
Published: (2024)
O(1)-Distortion Planar Emulators for String Graphs
by: Chang, Hsien-Chih, et al.
Published: (2025)
by: Chang, Hsien-Chih, et al.
Published: (2025)
Time warping with Hellinger elasticity
by: Billig, Yuly
Published: (2026)
by: Billig, Yuly
Published: (2026)
Random zero sets with local growth guarantees
by: Chang, Alan, et al.
Published: (2024)
by: Chang, Alan, et al.
Published: (2024)
On $\ell_p$-Vietoris-Rips complexes
by: Ivanov, Sergei O., et al.
Published: (2024)
by: Ivanov, Sergei O., 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)
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
by: Bhore, Sujoy, et al.
Published: (2023)
by: Bhore, Sujoy, et al.
Published: (2023)
Dynamic Metric Embedding into $\ell_p$ Space
by: Banihashem, Kiarash, et al.
Published: (2024)
by: Banihashem, Kiarash, et al.
Published: (2024)
A face cover perspective to $\ell_1$ embeddings of planar graphs
by: Filtser, Arnold
Published: (2019)
by: Filtser, Arnold
Published: (2019)
Connectivity Labeling in Faulty Colored Graphs
by: Petruschka, Asaf, et al.
Published: (2024)
by: Petruschka, Asaf, et al.
Published: (2024)
On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications
by: Filtser, Arnold
Published: (2024)
by: Filtser, Arnold
Published: (2024)
Dynamic Light Spanners in Doubling Metrics
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Dynamic Locality Sensitive Orderings in Doubling Metrics
by: La, An, et al.
Published: (2024)
by: La, An, et al.
Published: (2024)
Upward Book Embeddings of Partitioned Digraphs
by: Da Lozzo, Giordano, et al.
Published: (2026)
by: Da Lozzo, Giordano, et al.
Published: (2026)
Ranking and Unranking of the Planar Embeddings of a Planar Graph
by: Di Battista, Giuseppe, et al.
Published: (2024)
by: Di Battista, Giuseppe, et al.
Published: (2024)
Single-Criteria Metric $r$-Dominating Set Problem via Minor-Preserving Support
by: Browne, Reilly, et al.
Published: (2026)
by: Browne, Reilly, et al.
Published: (2026)
Moderate Dimension Reduction for $k$-Center Clustering
by: Jiang, Shaofeng H. -C., et al.
Published: (2023)
by: Jiang, Shaofeng H. -C., et al.
Published: (2023)
Reconstructing Riemannian Metrics From Random Geometric Graphs
by: Huang, Han, et al.
Published: (2025)
by: Huang, Han, et al.
Published: (2025)
Parks and Recreation: Color Fault-Tolerant Spanners Made Local
by: Parter, Merav, et al.
Published: (2024)
by: Parter, Merav, et al.
Published: (2024)
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)
Hardness of Median and Center in the Ulam Metric
by: Fischer, Nick, et al.
Published: (2025)
by: Fischer, Nick, et al.
Published: (2025)
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
by: S, Ajaykrishnan E, et al.
Published: (2025)
by: S, Ajaykrishnan E, et al.
Published: (2025)
Generic Global Rigidity in $\ell_p$-Space and the Identifiability of the $p$-Cayley-Menger Varieties
by: Sugiyama, Tomohiro, et al.
Published: (2024)
by: Sugiyama, Tomohiro, et al.
Published: (2024)
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
by: Depian, Thomas, et al.
Published: (2025)
by: Depian, Thomas, et al.
Published: (2025)
The Peculiarities of Extending Queue Layouts
by: Depian, Thomas, et al.
Published: (2025)
by: Depian, Thomas, et al.
Published: (2025)
The Parameterized Complexity of Extending Stack Layouts
by: Depian, Thomas, et al.
Published: (2024)
by: Depian, Thomas, et al.
Published: (2024)
Exact Algorithms for Clustered Planarity with Linear Saturators
by: Da Lozzo, Giordano, et al.
Published: (2024)
by: Da Lozzo, Giordano, et al.
Published: (2024)
A Polynomial Coreset for Furthest Neighbor in Planar Metrics
by: Kluk, Kacper, et al.
Published: (2026)
by: Kluk, Kacper, et al.
Published: (2026)
Terminal Embeddings in Sublinear Time
by: Cherapanamjeri, Yeshwanth, et al.
Published: (2021)
by: Cherapanamjeri, Yeshwanth, et al.
Published: (2021)
Upward Pointset Embeddings of Planar st-Graphs
by: Alegria, Carlos, et al.
Published: (2024)
by: Alegria, Carlos, et al.
Published: (2024)
Light Spanners with Small Hop-Diameter
by: Bhore, Sujoy, et al.
Published: (2025)
by: Bhore, Sujoy, et al.
Published: (2025)
Faster exponential algorithms for cut problems via geometric data structures
by: Kozma, László, et al.
Published: (2025)
by: Kozma, László, et al.
Published: (2025)
Similar Items
-
Fast Nearest Neighbor Search for $\ell_p$ Metrics
by: Krauthgamer, Robert, et al.
Published: (2026) -
Lipschitz Decompositions of Finite $\ell_{p}$ Metrics
by: Krauthgamer, Robert, et al.
Published: (2025) -
Fitting trees to $\ell_1$-hyperbolic distances
by: Yim, Joon-Hyeok, et al.
Published: (2024) -
Time complexity of the Analyst's Traveling Salesman algorithm
by: Ramirez, Anthony, et al.
Published: (2022) -
On Approximability of Steiner Tree in $\ell_p$-metrics
by: Fleischmann, Henry, et al.
Published: (2023)