arXiv (All)
open access
Tight Approximation Thresholds for Geometric Stabbing
We study geometric covering problems: stabbing axis-parallel squares and cubes by coordinate hyperplanes, stabbing horizontal segments by horizontal and vertical lines, and transversal of separated $d$-intervals. We prove matching NP-hardness bounds for their natural covering-LP thresholds. For ever
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
- Covering large-dimensional Euclidean spaces by random translates of a given convex body#617880
- Covering large-dimensional Euclidean spaces by random translates of a given convex body#617380
- Moving Geometric Objects to Render Their Intersection Graph Connected or Locally Dense#1048354
- Every cubic graph has four total dominating sets covering each vertex at most twice#1345273
- An Intersection Cutting Plane Algorithm for Chance-Constrained Programs with Finite Support#1119019
Record · ID 1326364
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