arXiv (All)
open access
Endpoint Covering of Axis-Parallel Segments:Bichromatic and Monochromatic One-Center
We study exact one-center optimization for axis-parallel segments using axis-parallel squares under endpoint-based coverage, where a segment is \emph{$1$-covered} if the square contains at least one of its endpoints. In the monochromatic problem, we seek a minimum-side-length square that $1$-cover
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
- The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings#1082959
- Local decisions, diffusive influence, and lower bounds for graphical balanced allocation#1143327
- Arranging circles of radii 1,2,...,n around a central circle: a Supnick TSP and certified finite optima#1123180
- Greedy Packing of Nested Rings: Placement Rules, a Golden Counterexample, and a Tribonacci Floor#1123274
- Local large deviations for triangles in sparse random graphs#1036279
Record · ID 1077748
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