arXiv (All)
open access
A Fixed-Parameter Algorithm for 4-Block Integer Programming
We give a fixed parameter tractable (FPT) algorithm with running time $f(k,Δ)\cdot {|I|}^{O(1)}$ for integer linear programs with 4-block structure, parameterized by the maximum block dimension $k$ and the largest absolute matrix entry $Δ$. This result resolves a long-standing open question in param
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
- 4-Block Integer Programming is in FPT#1062672
- A threshold for maximal Schmidt number from spectrum#1119328
- AN INTELLIGENT SYSTEM FOR FORMULATING LINEAR PROGRAMS#933636
- Improved lower bounds on the maximum size of graphs with girth 5#1061619
- Patenting in 4IR technologies and firm performance#163480
Record · ID 1049447
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