arXiv (All)
open access
Solving Stackelberg Vertex Cover on trees using split and join
The Stackelberg Vertex Cover problem is a bilevel optimization problem with two players on a graph G = ($F \cup P$, E) where each vertex from F has a weight and the first player selects a price for each vertex in P . Afterwards, the second player finds a minimum weight vertex cover X and the first p
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
- Coefficientwise Extremality and Rigidity for Independent Sets in Bipartite Graph Covers#1325788
- The Minimum-Weight Mixed Dominating Set on Threshold Graphs#924639
- Parameterized Capacitated Vertex Cover Revisited#1325134
- Disjoint covering of bipartite graphs with $s$-clubs#152998
- Counting Weight-$k$ Italian Dominating Sets on Trees and Cycles#1154731
Record · ID 1202158
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