arXiv (All)
open access
Parameterized Capacitated Vertex Cover Revisited
Capacitated Vertex Cover is a generalization of Vertex Cover where we seek a set of $k$ vertices covering all edges, but with the added constraint that for each vertex we are given a capacity, that is, a maximum number of incident edges the vertex can cover if selected. This problem is well-studied
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
- Capacitated Partition Vertex Cover and Partition Edge Cover#1129149
- Local Clique Covers and Chromatic Number#985390
- Boolean dimension and dim-boundedness: Planar cover graph with a zero#1328231
- Disjoint covering of bipartite graphs with $s$-clubs#152998
- Counting Weight-$k$ Italian Dominating Sets on Trees and Cycles#1154731
Record · ID 1325134
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