arXiv (All)
open access
Capacitated Partition Vertex Cover and Partition Edge Cover
Our first focus is the Capacitated Partition Vertex Cover (C-PVC) problem in hypergraphs. In C-PVC, we are given a hypergraph with capacities on its vertices and a partition of the hyperedge set into $ω$ distinct groups. The objective is to select a minimum size subset of vertices that satisfies two
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
- A sandwich theorem for the spectrum of graph coverings#1131183
- Closed escape path of smallest diameter in forest: dual formulation of Lebesgue's universal covering problem#1117643
- Identifying domatic partitions via graph dynamical systems#1083938
- Curves of constant width and Lebesgue's covering problem#820693
- Three-Layer Intersecting Temperate Families#1051150
Record · ID 1129149
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