arXiv (All)
open access
Optimal Coresets for Hyperbolic Farthest-Point Queries via Ideal-Boundary Envelopes
We study coresets for farthest-point queries in hyperbolic space. Given a nonempty finite set $P \subset \mathbb{H}^D$ and $0<\varepsilon \le 1$, we seek a coreset $P_{\varepsilon} \subseteq P$ whose farthest distance from every query point underestimates that of $P$ by at most an additive $\varepsi
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
- Coresets for Continuous $k$-Center in Hyperbolic Space#985136
- Hausdorff-Young inequalities for $\mathrm{SU}(1,1)$ Fourier products indexed by binary cubes#1078024
- Boundary Spectral Inequalities from Measurable Sets and Heat Observability on $C^{1,1}$ Domains#662218
- Boundary Spectral Inequalities from Measurable Sets and Heat Observability on $C^{1,1}$ Domains#661168
- Two-color Ramsey lower bounds for bounded degree hypergraphs#1083062
Record · ID 1156065
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