arXiv (All)
open access
Sensitivity Oracles for Matroid Packing, Matroid Covering, and Matching Problems with Applications
Sensitivity oracles preprocess a graph so that queries can be answered after any $f$ edge insertions and deletions, without recomputing from scratch. For structural optimization problems the known landscape is limited: for flows and cuts, all known compact oracles handle only $f\le2$ failures; exist
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
- Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration#1156377
- DueList: A Theory of Lists with Combinators for SMT Solvers#1078033
- A Faster Auction Algorithm for Weighted Matroid Intersection#1155855
- Equally Good, Yet Different: Benchmarking Rashomon sets in AutoML packages#1132171
- Combinatorial Optimization#66996
Record · ID 821236
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