arXiv (All)
open access
Approximation guarantees for Hub Covering Problems
Hub Covering Problems are a subclass of Hub Location Problems. The objective is to select a set of hubs that enable paths between given origin-destination delivery tasks, while minimizing the total setup cost of the hubs. Two constraints must be satisfied: each path must include one or two hubs, and
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
- Minimum Sum Vertex Cover via Minimum Vertex Cover#1063328
- Avoiding traps, rescaling states, governing Europe.#1039488
- Capacitated Partition Vertex Cover and Partition Edge Cover#1129149
- X-CAD: Optimizing CAD Models with Extended Finite Elements#254447
- An iterative rounding $2$-approximation for Feedback Vertex Set via AI-assisted proof of an extreme point property#927704
Record · ID 997428
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