arXiv (All)
open access
Integrality gap preserving reductions
We propose a framework for the systematic study of integrality gaps of combinatorial optimization problems with respect to a fixed linear programming formulation. The method, called \emph{integrality gap preserving reduction}, consists of iteratively shrinking the input universe of the problem while
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
- On the worst case complexity of potential reduction algorithms for linear programming#429995
- An Approximation Algorithm for Monotone Submodular Cost Allocation#1012077
- Integer Programming and Combinatorial Optimization#3580
- Optimization in Machine Learning: Decision Trees, Sparse Linear Models and LLM Pruning#923193
- On the Complexity of Forcing and Anti-Forcing Minimum Cuts#1118004
Record · ID 1033749
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