arXiv (All)
open access
Vertex Cover Problem with Advice
We study the minimum Vertex Cover problem under two non-adaptive offline advice models, where predictions about a fixed optimum solution are provided once as part of the input. These forms of prediction were introduced independently by Cohen-Addad, d'Orsi, Gupta, Lee, and Panigrahi (2024) and by Gho
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
- Learning to Explain Solutions of Optimal Control Problems#1218228
- Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees#662086
- Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees#661036
- The Path-Extremal Conjecture for Zero Forcing: Distance-Hereditary Graphs and a Split-Decomposition Reduction#819366
Record · ID 1199180
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