arXiv (All)
open access
Closed escape path of smallest diameter in forest: dual formulation of Lebesgue's universal covering problem
Lebesgue's universal covering problem asks for the minimum area convex planar region capable of containing a congruent copy of every planar set of diameter at most one. In this paper, we develop an exact dual formulation of this problem through a minimum diameter analogue of Bellman's lost-in-a-fore
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
- Curves of constant width and Lebesgue's covering problem#820693
- An exact hierarchy for Lebesgue's universal covering constant and a certified 0.834 lower bound#821237
- A sandwich theorem for the spectrum of graph coverings#1131183
- Capacitated Partition Vertex Cover and Partition Edge Cover#1129149
- Optimal Extensions of Cross-Sections: Sphere Packings in Dimensions 38 to 43#793790
Record · ID 1117643
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