arXiv (All)
open access
A Bicriteria Approximation Scheme for the Minimum Well-Separated Pair Decomposition
A well-separated pair decomposition (WSPD) of a set $P$ of $n$ points covers all $\binom{n}{2}$ pairs of points by a family of dumbbells $\{X,Y\}$, each covering the pairs of $X\times Y$, such that the diameters of $X$ and $Y$ are at most an $\varepsilon$-fraction of their distance. In $\mathbb{R}^d
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
- A Smooth Covariogram and the Transition Between Projection Bodies#1248980
- Symmetrizing Bregman Divergence on the Cone of Positive Definite Matrices: Which Mean to Use and Why#1011066
- Nyström method for symmetric indefinite matrices#659096
- Nyström method for symmetric indefinite matrices#656960
- Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity#310805
Record · ID 1298146
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