arXiv (All)
open access
The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case
In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an inter
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
- New Upper bounds on the Mondrian Art Problem#822406
- MCI: A Maximal Clique Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search#134637
- Filter Learning for Subgraphs: Algebras and Performance Risk Bounds#394421
- A Note on Sphere Packing Bounds for Tuple Lattice Sieving#667908
- A Simple Algorithm for the Directed Multiple Source Replacement Paths Problem#625189
Record · ID 998661
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