arXiv (All)
open access
Fast Geometric Spanners via Approximate Nearest Neighbor Search
We study the problem of constructing metric spanners in general metric spaces in subquadratic time when given blackbox access to a fast algorithm for batch approximate nearest neighbor search. In particular, we show the following results for any metric space $\mathsf{M} = ([n], \mathsf{d})$ with asp
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Revisiting Approximate Metric Optimization in the Age of Deep Neural Networks#19754
- A New Gap Sequence for Shellsort: RL-Driven Algorithm Discovery Beyond $N^{4/3}$#1077952
- FoundDSR: A Generalizable Foundation Model with Guided 2D Gaussian Splatting for Depth Super-Resolution#1116654
- ADATEX4D: adaptive texture capacity allocation for 4D gaussian splatting#1078034
- The Art of Approximation in Science and Engineering#3471
Record · ID 1063145
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive